Strictly local languages, Theory of Computation

While the SL2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless-the behavior of the automaton depends only on the most recent symbol it has read.

Certainly there are many languages of interest that are not SL2, that will require a more sophisticated algorithm than strictly 2-local automata.

One obvious way of extending the SL2 automata is to give them more memory. Consider, for instance, the language of algebraic expressions over decimal integer constants in which we permit negative constants, indicated by a pre?x ‘-'. Note that this is not the same as allowing ‘-' to be used as a unary operator. In the latter case we would allow any number of ‘-'s to occur in sequence (indicating nested negation), in the case in hand, we will allow ‘-'s to occur only singly (as either a subtraction operator or a leading negative sign) or in pairs (as a subtraction operator followed by a leading negative sign). We will still forbid embedded spaces and the use of ‘+' as a sign.

This is not an SL2 language. If we must permit ‘--' anywhere, then we would have to permit arbitrarily long sequences of ‘-'s. We can recognize this language, though, if we widen the automaton's scanning window to three symbols.

Posted Date: 3/22/2013 1:17:52 AM | Location : United States







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

Write discussion on Strictly local languages
Your posts are moderated
Related Questions
Let L 3 = {a i bc j | i, j ≥ 0}. Give a strictly 2-local automaton that recognizes L 3 . Use the construction of the proof to extend the automaton to one that recognizes L 3 . Gi

how to find whether the language is cfl or not?

The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations

We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions. Here whenever the automaton is in state 1

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

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

Paths leading to regions B, C and E are paths which have not yet seen aa. Those leading to region B and E end in a, with those leading to E having seen ba and those leading to B no

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

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

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.