Modular -Midterm Exam Automata

An automaton that presents output based on previous state or current input:

• Acceptor

• Classifier

• Transducer

• None of the mentioned.

NFA, in its name has ’non-deterministic’ because of :

• The result is undetermined

• The state to be transited next is non-deterministic

• The choice of path is non-deterministic

• All of the mentioned

The DFA shown below accepts the set of all strings over {0, 1} that

• Contain the substring 00

• End with 00

• End with 0

• Begin either with 0 or 1

From current state, on reading input symbol, it moves to more than one state

• DFA

• NFA

• DFA with epsilon transitions

Equivalent automata that accepts regular language is

A___________ is a collection of sentences of finite length all constructed from a finite alphabet of symbols.

FA can be used for

• calculating square root

• arithmetic operations

• comparision

• string recognition

The finite state machine given in figure over alphabet {a,b} recognizes

• Any string with odd number of 'a'

• Any string with odd number of 'a' and even number of 'b'

• Any string with odd number of 'a' and odd number of 'b'

• Any string with odd number of 'b'

The method to convert NFA to DFA

• set construction

• alphabet construction

• transition construction

• sub-set construction

A DFA can be represented in the following format

• Tree

• Transition table

• C Code

• None of the mentioned