Computation of an automaton, Theory of Computation

The computation of an SL2 automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |-A and which starts with the initial con?guration of A on w: (p1,w1), where p1 . w1 = ?w?.

Since w is ?nite, the computation of A on w will be ?nite. Since it is required to be maximal, the last ID will be one that does not directly compute any other ID. This will either be of the form (σiσj) , wii where σiσj ∈ T, or of the form (σn?, ε), in which σn? ∈ T but all the input has been consumed. In the ?rst case we will say that the computation is rejecting (or that it crashes). In the second we will say that it is accepting. Note that we have adopted the convention that the automaton halts with FALSE as soon as it encounters a pair of symbols that are not in T.

Posted Date: 3/21/2013 5:46:36 AM | Location : United States







Related Discussions:- Computation of an automaton, Assignment Help, Ask Question on Computation of an automaton, Get Answer, Expert's Help, Computation of an automaton Discussions

Write discussion on Computation of an automaton
Your posts are moderated
Related Questions
While the SL 2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless

shell script to print table in given range


To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the

implementation of operator precedence grammer

You are required to design a system that controls the speed of a fan's rotation. The speed at which the fan rotates is determined by the ambient temperature, i.e. as the temperatur

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

Computer has a single FIFO queue of ?xed precision unsigned integers with the length of the queue unbounded. You can use access methods similar to those in the third model. In this


State and Prove the Arden's theorem for Regular Expression