Strictly 2 - local automata, Theory of Computation

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 alphabet. The automaton starts with the window positioned over the beginning of string marker and the first symbol of the word (if any). At each step, it looks up the pair of symbols in the window in a table of pairs of symbols. It halts when the end of string marker is in the window (if not sooner).

The S-R element is a set/reset latch. It holds the current output which is initially set to TRUE by driving the START input FALSE. (The inverting circle and vinculum over the signal name indicate an input that is activated when it is driven FALSE.) It is then is reset to FALSE if any pair of symbols in the window fails to match some pair in the lookup table (if output of the ‘∈' element ever goes FALSE). Once reset it remains FALSE. Since the output will be FALSE at the end of the string if it ever goes FALSE during the computation, we may just as well assume that the automaton halts when the first pair that is not in the lookup table is encountered.

Formally, all we need do to specify a particular instance of a strictly 2-local automaton is to give the alphabet and list the pairs of symbols in the internal table.

Posted Date: 3/21/2013 5:40:24 AM | Location : United States

Related Discussions:- Strictly 2 - local automata, Assignment Help, Ask Question on Strictly 2 - local automata, Get Answer, Expert's Help, Strictly 2 - local automata Discussions

Write discussion on Strictly 2 - local automata
Your posts are moderated
Related Questions
build a TM that enumerate even set of even length string over a

what are the advantages and disadvantages of wearable computers?

Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program

How useful is production function in production planning?

prove following function is turing computable? f(m)={m-2,if m>2, {1,if

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff ≡L partitions Σ* into ?nitely many Nerode equivalence classes. Proof: For the "only if" direction (that every recogn

Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima