COMPILER DESIGN

Previous
Next

LEXICAL ANALYSIS

REGULAR EXPRESSIONS AND FINITE AUTOMATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Number of final state require to accept in minimal finite automata.
A
0
B
1
C
2
D
3
Explanation: 

Detailed explanation-1: -1 Answer. Number of finfinal state(s) require to accept in minimal finite automata is ZERO. Number of state(s) require to accept in finite automata is ONE.

Detailed explanation-2: -A DFA must always have an initial state, so the minimum number of states needed to accept the empty language is one. Thank you, Definition of DFA does not require the set of final states to be non empty.

Detailed explanation-3: -The minimum number of states is 4.

Detailed explanation-4: -Finite automata have two states, Accept state or Reject state. When the input string is processed successfully, and the automata reached its final state, then it will accept.

Detailed explanation-5: -The FSM accepts iffit stops in a final state, denoted by a double circle. A finite state machine (FSM) consists of a finite set of states, a finite input alphabet, a transition function that maps each state in and input in to a state in, a start state, and a set of final states .

There is 1 question to complete.
Previous
Next