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
The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

how to find whether the language is cfl or not?

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

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

shell script to print table in given range

Theorem The class of recognizable languages is closed under Boolean operations. The construction of the proof of Lemma 3 gives us a DFA that keeps track of whether or not a give

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

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?