Two-way finite automaton: Difference between revisions

Revision as of 03:10, 11 October 2021

Revision as of 11:12, 30 October 2021

Line 39:

:<math>\delta(q,L)=(q^\prime,\mathrm{right})</math> for some <math>q^\prime \in Q</math>

:<math>\delta(q,R)=(q^\prime,\mathrm{left})</math> for some <math>q^\prime \in Q</math>

It says that there must be some transition possible when the pointer onreaches theeither alphabetend reachesof the endinput word.

* For all symbols <math>\sigma \in \Sigma \cup \{L\}</math>

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