Two-way finite automaton: Difference between revisions

Revision as of 09:31, 15 April 2020

Revision as of 13:27, 1 May 2020

Line 45:

: <math>\delta(t,R)=(t,L)</math>

: <math>\delta(r,R)=(r,L)</math>

It says that once the automaton reaches the accept or reject state, it stays in there forever and the pointer goes to the right most symbol and cycles there infinitely.<ref>This definition has been taken from lecture notes of CS682 (Theory of ComoputationComputation) by Dexter Kozen of Stanford University</ref>

== Two-way nondeterministic finite automaton ==