In the last chapter we mentioned some sets of input sequences which could not be described by regular expressions and which therefore could not be recognized by any finite automaton. It turns out that there are more general and powerful kinds of machines which can easily recognize those events. It is thus natural to seek the limits of mechanical behavior. Can we define a type of abstract machine, no matter how impractical it might be to build, which can compute anything that we regard as computable? Are there precisely describable processes that cannot be implemented on any machine?
KeywordsTuring Machine Finite Automaton Context Free Grammar State Transition Diagram Terminal Symbol
Unable to display preview. Download preview PDF.