Automata

It is less complex to prove the closure properties over regular languages using

• NFA

• DFA

• PDA

• Can’t be said

Which of the following is an application of Finite Automaton?

• Compiler Design

• Grammar Parsers

• Text Search

• All of the mentioned

John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?

• 9

• 11

• 12

• 15

L1= {w | w does not contain the string tr }
L2 = {w | w does contain the string tr}
Given ∑ = {t, r}, The difference of the minimum number of states required to form L1 and L2?

• 0

• 1

• 2

• Cannot be said

Predict the number of transitions required to automate the following language using only 3 states:
L = {w | w ends with 00}

• 3

• 2

• 4

• Cannot be said