{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}


Lecture12-1_Part20 - B s initial state as its current state...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Assume that the DFA is encoded by a list of its components. TM M should first verify that the string representing B is well formed. Than it should use a “state dot” to mark
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: B s initial state as its current state and an input dot to mark w s first symbol as the current input symbol. Simulation of a DFA Initialization 20...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online