Question
a.
Writing
b.
Finite memory
c.
Pattern recognition
d.
Both (a) and (b)
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. Limitation of a FA is
Similar Questions
Discover Related MCQs
Q. A FA with deterministic transitions capability is known as
View solution
Q. Two – way finite automata has
View solution
Q. The palindromes can’t be recognized by a FA because
View solution
Q. A FA can be used for
View solution
Q. In computer, finite automata program can be stored using
View solution
Q. Finite automation and FSMS are used for
View solution
Q. Finite automata has
View solution
Q. Which of the following identity is wrong?
View solution
Q. A context free language is called ambiguous if
View solution
Q. Transition of finite automata is
View solution
Q. The idea of an automation with a stack as auxiliary storage
View solution
Q. CFG is
View solution
Q. Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
View solution
Q. Which of the following strings can be obtained by the language L = { a^i b^2i / i≥ 1}?
View solution
Q. Let R1 and R2 be regular sets defined over alphabet ∑ then
View solution
Q. Consider the production of the grammar:
S->AA A->aa A->bb
Describe the language specified by the production grammar.
View solution
Q. L and ~L are recursive enumerable then L is
View solution
Q. Which of the following is true ?
View solution
Q. Which of the following strings is NOT in the Kleene star of the language {011, 10, 110}?
View solution
Q. The transitions which does not take an input symbol are called
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!
