Section 10.

3
Finite State Machines with No Output
Definition: Suppose that A and B are subsets of V*,
where V is a vocabulary. The concatenation of A and
B, denoted by AB, is the set of all strings of the form
xy where x is a string in A and y is a string in B

Example
Suppose A={0, 11} B={1, 10, 110}. Find AB and
BA

Solution: AB={01, 010, 0110, 111, 1110, 11110}

BA={10, 111, 100, 1011, 1100, 11011}

Example
A={1,00}. Find An for n=0,1,2 and 3.

Solution:
A0={λ}, A1=A0A={ λ}A={1, 00}
A2={11, 100, 001, 0000}
A3={111, 1100, 1001, 10000, 0011, 00100, 00001,
000000}

1
Definition: Suppose A is a subset of V*. Then the
Kleene closure of A, denoted by A*, is the set
consisting of concatenations of arbitrarily many
strings from A. That is, A*=U∞k=0Ak. For example,
the Kleene closure of {11} is {12n | n=0, 1, 2 …}.

Deterministic Finite-State Automata

Definition: A finite-state automaton M=(S, I, f, s0, F)

consists of a finite set S of states, a finite input
alphabet I, a transition function f that assigns a next
state to every pair of state and input, an initial state
s0, and a subset F of S consisting of final states.

Table S1
0 1
1
State f
0
Input S3
S0 1
0 1
S0 S0 S1 start 0
S1 S0 S2 0,1
S2 S0 S0 S2
S3 S2 S1

2
 Nondeterministic Finite-State Automata

Definition: A nondeterministic finite-state automaton

M=(S, I, f, s0, F) consists of a set S of states, an input
alphabet I, a transition function f that assigns a set of
states to each pair of state and input, a starting state
s0, and a subset F of S consisting of the final states.

Theorem: If a language L is recognized by a

nondeterministic finite-state automaton M0, then
L is also recognized by a deterministic finite-
state automaton M1.

3
 Example
Find the nondeterministic finite state machine
diagram of the following state table.

What is the language recognized by this

nondeterministic finite state machine if S0 and
S4 are final states?

State f
Input
0 1
S0 S0,S2 S1
S1 S3 S4
S2 S4
S3 S3
S4 S3 S3