Question: Finite state machine are not able to recognize Palindromes because:
Options
A : Finite automata cannot deterministically find the midpoint
B : Finite automata cannot remember arbitarily large amount of data
C : Even if the mid point is known, it cannot find whether the second half matches the first
D : All of the mentioned
Properties-Non Regular Languages more questions
Which of the following options are correct with reference to....
Which of the functions are not performed by the turing....
Which of the problems were not answered when the turing....
A regular language over an alphabet a is one that....
Given languages:^ i) {anbn|n>=0}^ ii) <div>n</div>n^ iii) {w?{a,b}?| #a(w)=#b(w)}, #....
Myphill Nerode does the following:
Precedence of regular expression in decreasing order is
Regular expression {0,1} is equivalent to
Regular expression ?* is equivalent to
Ambiguous Grammar more Online Exam Quiz
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Regular Language & Expression - 1
Turing Machine-Notation and Transition Diagrams
Engine Components - Connecting Rod