Question
a.
A FSM cannot remember arbitrarily large amount of information
b.
A FSM cannot fix the midpoint
c.
A FSM cannot match W with WR
d.
A FSM cannot remember first and last inputs
Posted under Finite Automata 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 string WWR is not recognized by any FSM because
Similar Questions
Discover Related MCQs
Q. A finite automata recognizes
View solution
Q. Which is true for Dead State?
View solution
Q. Which is true for Moore Machine?
View solution
Q. Which is true for Mealy Machine?
View solution
Q. Which is true for in accessible state?
View solution
Q. In Mealy Machine O/P is associated with
View solution
Q. In Moore Machine O/P is associated with
View solution
Q. Which NDFA correctly represents the following RE
a(bab)*∪a(ba)*
View solution
Q. Which is the correct NDFA for the following mentioned expression?
(ab)*∪(aba)*
View solution
Q. NDFAs where introduced by ____________
View solution
Q. The regular languages are not closed under
View solution
Q. The Tuples for NDFA
View solution
Q. NFAs are ___ DFAs.
View solution
Q. An NFA’s transition function returns
View solution
Q. Conversion of a DFA to an NFA
View solution
Q. An NFA may be converted to a DFA using
View solution
Q. The subset construction shows that every NFA accepts a
View solution
Q. Construct a NDFA for the following regular expression
(a∪b)*aba(a∪b)*
View solution
Q. Which is the application of NFA
View solution
Q. Can a DFA simulate NDFA
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!
