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
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

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

a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le

The Equivalence Problem is the question of whether two languages are equal (in the sense of being the same set of strings). An instance is a pair of ?nite speci?cations of regular

This was one of the ?rst substantial theorems of Formal Language Theory. It's maybe not too surprising to us, as we have already seen a similar equivalence between LTO and SF. But

Our DFAs are required to have exactly one edge incident from each state for each input symbol so there is a unique next state for every current state and input symbol. Thus, the ne

Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

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

Rubber shortnote

Given any NFA A, we will construct a regular expression denoting L(A) by means of an expression graph, a generalization of NFA transition graphs in which the edges are labeled with