Professional Documents
Culture Documents
Final Exam For Finite Automata
Final Exam For Finite Automata
a) ε
b) 11010
c) 10001010
d) String of letter count 11
11. A push down automaton employs ________ data structure.
a) Queue
b) Linked List
c) Hash Table
d) Stack
12. Push down automata accepts _________ languages.
a) Regular Language
b) Non-Regular Language
c) May be Regular
d) context free language
13. Which of the following will not be accepted by the following DFA?
a) ababaabaa
b) abbbaa
c) abbbaabb
d) abbaabbaa
II. Short answer
1. Draw a DFA for the language accepting strings ending with ‘abb’ over input alphabets ∑
= {a, b}
2. Draw a DFA for the language accepting strings ending with ‘0’ over input alphabets
∑={0, 1} ?