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
design a turing machine that accepts the language which consists of even number of zero''s and even number of one''s?

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting

automata of atm machine

We will assume that the string has been augmented by marking the beginning and the end with the symbols ‘?' and ‘?' respectively and that these symbols do not occur in the input al

Another way of interpreting a strictly local automaton is as a generator: a mechanism for building strings which is restricted to building all and only the automaton as an inexh


design a tuning machine for penidrome

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

turing machine for prime numbers

Both L 1 and L 2 are SL 2 . (You should verify this by thinking about what the automata look like.) We claim that L 1 ∪ L 2 ∈ SL 2 . To see this, suppose, by way of con