Ì Exam ple 1.6.2: Give examples for Moore and Mealy Models of finite
automata with outputs.
Solu tion
State Table shown in Fig. (a) represents a Moore Machine and that of Fig. (b)
shows a Mealey Machine.
Cur rent
State
Next State δ
Out put
λ
Input
0
1
Input →
q 0
q 3
q 1
0
q 1
q 1
q 2
1
q 2
q 2
q 3
0
q 3
q 3
q 0
0
Fig. (a)
Next State
Input 0
Input 1
State
Out put
State
Out put
Input →
q 1
q 3
0
q 2
0
q 2
q 1
1
q 4
0
q 3
q 2
1
q 1
1
q 4
q 4
1
q 3
0
Fig. (b)
1.7 PROPERTIES OF REGULAR SETS (LANGUAGES)
A regular set (language) is a set accepted by a finite automaton.
1.7.1 Clo sure
A set is closed under an operation if, whenever the operation is applied to
members of the set, the result is also a member of the set.
For example, the set of integers is closed under addition, because x + y is
an integer whenever x and y are integers. However, integers are not closed
under division: if x and y are integers, x/y may or may not be an integer.
DFA and NFA
91