COMPILER DESIGN

Previous
Next

LEXICAL ANALYSIS

REGULAR EXPRESSIONS AND FINITE AUTOMATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Predict the number of transitions required to automate the following language using only 3 states:L= {w | w ends with 00}
A
2
B
3
C
4
D
5
Explanation: 

Detailed explanation-1: -Hence, the number of transitions required to automate the given language L using only 3 states is 6, which is option ‘A’.

Detailed explanation-2: -Here you can find the meaning of Given:L1= x ∑*|x contains even no’s of 0’sL2= x ∑*|x contains odd no’s of 1’sNo of final states in Language L1 U L2? a)1b)2c)3d)4Correct answer is option ‘C’.

Detailed explanation-3: -8. The maximum number of transition which can be performed over a state in a DFA? Explanation: The maximum number of transitions which a DFA allows for a language is the number of elements the transitions constitute.

Detailed explanation-4: -Therefore, the maximum number of transitions that can be performed over a state in this DFA is equal to the number of symbols in the input alphabet. 5. So, the maximum number of transitions is 3 (one for each symbol: a, b, and c).

There is 1 question to complete.
Previous
Next