CS 417: LECTURE IV
Adrian Dumitrescu
Closure under Concatenation
Nondeterminism
c Adrian Dumitrescu, 2016
Closure under concatenation
Theorem
The class of regular languages is closed under concatenation.
Proof. We need to show that if A1 , A2 are regula
CS 417: LECTURE III
Adrian Dumitrescu
Design of Finite Automata (DFAs)
Closure under Regular Operations
c Adrian Dumitrescu, 2016
Design of Finite Automata
Example 1: Construct M1 so that L(M1 ) = all binary strings with
an odd number of 1s.
Have to fi
CS 417: LECTURE I
Adrian Dumitrescu
AUTOMATA, COMPUTABILITY AND
COMPLEXITY
c Adrian Dumitrescu, 2012
Mathematical background
Notation: Notation is very important to remember & use
consistently
I
set cfw_2, 7, 77,
I
subset cfw_2, 7 cfw_2, 7, 77,
I
multiset
CS 417: LECTURE II
Adrian Dumitrescu
Deterministic Finite Automata (DFAs)
c Adrian Dumitrescu, 2016
Finite Automata
These are devices with small (limited) memory.
Example 1:
1
0
0
M1 :
q1
1
q2
0, 1
q3
Here:
I
q1 is the start state
I
q2 is the accept state