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
Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

Sketch an algorithm for the universal recognition problem for SL 2 . This takes an automaton and a string and returns TRUE if the string is accepted by the automaton, FALSE otherwi

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

design a tuning machine for penidrome

Design a turing machine to compute x + y (x,y > 0) with x an y in unary, seperated by a # (descrition and genereal idea is needed ... no need for all TM moves)

Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

State & prove pumping lemma for regular set. Show that for the language L={ap |p is a prime} is not regular

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

Can you say that B is decidable? If you somehow know that A is decidable, what can you say about B?