Question
a.
Finite automata
b.
Push Down Automata
c.
Deterministic Automata
d.
None of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The idea of an automation with a stack as auxiliary storage
Similar Questions
Discover Related MCQs
Q. Transition of finite automata is
View solution
Q. A context free language is called ambiguous if
View solution
Q. Which of the following identity is wrong?
View solution
Q. Finite automata has
View solution
Q. Finite automation and FSMS are used for
View solution
Q. In computer, finite automata program can be stored using
View solution
Q. A FA can be used for
View solution
Q. The palindromes can’t be recognized by a FA because
View solution
Q. Two – way finite automata has
View solution
Q. A FA with deterministic transitions capability is known as
View solution
Q. Limitation of a FA is
View solution
Q. How many DFA’s exist with three states over the input alphabet {0,1}?
View solution
Q. A FA with non – deterministic transitions capability is known as
View solution
Q. The behaviour of a NFA can be simulated by a DFA
View solution
Q. A NFA can be enhanced to move to a next state without reading the input tape.
View solution
Q. A FA having more than one reading head has
View solution
Q. The palindrome unit can not be recognized by a FA because
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
