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
Let there L1 and L2 . We show that L1 ∩ L2 is CFG . Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the second

The path function δ : Q × Σ* → P(Q) is the extension of δ to strings: This just says that the path labeled ε from any given state q goes only to q itself (or rather never l

constract context free g ={ a^n b^m : m,n >=0 and n

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

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

We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

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

These assumptions hold for addition, for instance. Every instance of addition has a unique solution. Each instance is a pair of numbers and the possible solutions include any third

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included

First model: Computer has a ?xed number of bits of storage. You will model this by limiting your program to a single ?xed-precision unsigned integer variable, e.g., a single one-by