Finite State Machine Are Not Able To Recognize Palindromes #324
Finite state machine are not able to recognize Palindromes because:
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Regular Expressions and Languages - Properties-Non Regular Languages - Quiz No.1.
Finite state machine are not able to recognize Palindromes because:
Finite automata cannot deterministically find the midpoint
Finite automata cannot remember arbitarily large amount of data
Even if the mid point is known, it cannot find whether the second half matches the first
All of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
