Defining strictly local automata, Theory of Computation

One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define particular, given languages. Towards that end, note that a strictly 2-local automaton can require a particular symbol to appear at the beginning or end of the string and it can permit particular pairs of symbols to occur in the interior of the string but, in general, it can't require an arbitrary pair of symbols to occur in the interior of the string. Consider, for example the language:

639_De?ning Strictly Local Automata.png

This is just the set of all strings over {a, b} in which the sequence ‘ab' occurs at least once. Since the string aabaa is in L1, any strictly 2-local automaton will have to include at least the pairs:

fia, aa, ab, ba, afi.

But then the string aaaaa will also be accepted, using just the first two and the last one of these pairs. Roughly, as long as we have to permit other pairs starting with ‘a' we cannot require ‘ab' to occur.

Posted Date: 3/21/2013 5:51:00 AM | Location : United States







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

Write discussion on Defining strictly local automata
Your posts are moderated
Related Questions
DEGENERATE OF THE INITIAL SOLUTION

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

how many pendulum swings will it take to walk across the classroom?

draw pda for l={an,bm,an/m,n>=0} n is in superscript


turing machine for prime numbers

s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbol?

Prove that Language is non regular TRailing count={aa ba aaaa abaa baaa bbaa aaaaaa aabaaa abaaaa..... 1) Pumping Lemma 2)Myhill nerode

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 prove he extended transition function is derived from part 2 and 3