Scribd
Upload
417 views

DFA Questions

This document contains multiple choice questions about finite state machines and finite automata. Some key points addressed are: - There are an unlimited number of tuples in a finite state machine. - The transition function maps states and input symbols to next states. - A minimum of 2 states are required to accept a string that ends with 10. - The basic limitation of finite automata is that it cannot remember arbitrary large amounts of information.

Uploaded by

The Caspian
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
417 views

DFA Questions

This document contains multiple choice questions about finite state machines and finite automata. Some key points addressed are: - There are an unlimited number of tuples in a finite state machine. - The transition function maps states and input symbols to next states. - A minimum of 2 states are required to accept a string that ends with 10. - The basic limitation of finite automata is that it cannot remember arbitrary large amounts of information.

Uploaded by

The Caspian
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

• There are ________ tuples in finite state machine.

a) 4
b) 5
c) 6
d) unlimited
• Transition function maps.
a) Σ * Q -> Σ
b) Q * Q -> Σ
c) Σ * Σ -> Q
d) Q * Σ -> Q
• Number of states require to accept string ends with
10.
a) 3
b) 2
c) 1
d) can’t be represented
• Extended transition function is .
a) Q * Σ* -> Q
b) Q * Σ -> Q
c) Q* * Σ* -> Σ
d) Q * Σ -> Σ
• δ*(q,ya) is equivalent to .
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
• String X is accepted by finite automata if .
a) δ*(q,x) E A
b) δ(q,x) E A
c) δ*(Q0,x) E A
d) δ(Q0,x) E A
• Languages of a automata is
a) If it is accepted by automata
b) If it halts
c) If automata touch final state in its life time
d) All language are language of automata
• Language of finite automata is.
a) Type 0
b) Type 1
c) Type 2
d) Type 3
• Finite automata requires minimum _______
number of stacks.
a) 1
b) 0
c) 2
d) None of the mentioned
• Number of final state require to accept Φ in
minimal finite automata.
a) 1
b) 2
c) 3
d) None of the mentioned
• How many DFA’s exits with two states over input
alphabet {0,1} ?
a) 16
b) 26
c) 32
d) 64
• HINT- 2^n *n^2*n
• The basic limitation of finite automata is that
a) It can’t remember arbitrary large amount of
information.
b) It sometimes recognize grammar that are not
regular.
c) It sometimes fails to recognize regular grammar.
d) All of the mentioned
• Number of states require to simulate a computer
with memory capable of storing ‘3’ words each of
length ‘8’.
a) 3 * 28
b) 2(3*8)
c) 2(3+8)
d) None of the mentioned
• HINT- 2^m*n
• Under which of the following operation, NFA is not
closed?
a) Negation
b) Kleene
c) Concatenation
d) None of the mentioned
• It is less complex to prove the closure properties
over regular languages using
a) NFA
b) DFA
c) PDA
d) Can’t be said
• Predict the number of transitions required to
automate the following language using only 3
states:
L= {w | w ends with 00}
a) 3
b) 2
c) 4
d) Cannot be said

You might also like