Scribd
Upload
11 views3 pages

Concepts 2

Automata

Uploaded by

Bijay Nag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views3 pages

Concepts 2

Automata

Uploaded by

Bijay Nag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

10/29/2003 Z:\ jeh\Self\Courses\381 FAll 2003\Concepts 1

Notation
ε , {ε }, Φ
L1 L2 = {xy | x ∈ L1 y ∈ L2 }
L* = {ε } U L U L2 U L3 UL
2S set of all subsets
{0 10 1| n ≥ 1} and {0n10n1| n ≥ 1}*
n n

Concepts
fa
nfa
e-nfa
e-closure
regular set
regular expression
induction
definition of h h −1
closure properties of regular sets
Union, dot, star
complement machine construction
intersection L1 I L2 = L1 U L2 or cross product machine construction
h h −1
reversal
prove set not regular
valid computation of fa

Constructions
cross product construction
subset construction
hat technique
h ( h −1 ( L ) I R )
nfa to fa subset construction
fa to regular expression Rijk
regular expression to fa
valid computation of fa
Write regular expression from English description
often break string down into pieces
pumping lemma

Examples
shuffle
10/29/2003 Z:\ jeh\Self\Courses\381 FAll 2003\Concepts 2

Touched on
countably infinite
noncountably infinite
diagonalization
there exist non regular sets

Context-free languages
context free grammar
pda
acceptance by empty store, final state
one state pda
all regular sets are context-free languages
The regular sets are properly contained in the class of context-free
languages, i.e. there exist context-free languages that are not regular

Examples of cfl’s
{a i b j | i ≠ j} = {a i b j | i < j} U {a i b j | i > j}
{a i b j c k | either i<j or j<k}

Constructions
empty store to final state
final state to empty store
cfg to empty store
many state to one state
one state to cfg

Normal forms
no useless variables
if ε not in L(G) can eliminate ε -productions
if ε in L(G) need S → ε
eliminate unit productions
Chomsky normal form A → BC A → b

Pumping lemma
not cfl’s {a nb n c n | n ≥ 1} {a i b j c k | i < j < k}

Closure properties
substitution implies union, concatenation, star, homomorphism
reversal
inverse homomorphism
intersect with regular set

Not closed under


intersection
complement
10/29/2003 Z:\ jeh\Self\Courses\381 FAll 2003\Concepts 3

Decision algorithms
membership
emptiness

Undecidable
equivalence
equivalent to Σ*
emptiness of intersection

Efficient membership algorithm

You might also like