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

Lemma 1 A string w ∈ Σ* is accepted by an LTk automaton iff w is the concatenation of the symbols labeling the edges of a path through the LTk transition graph of A from h?, ∅i to

The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product

how to find whether the language is cfl or not?

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

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

design an automata for strings having exactly four 1''s

how to write program Minimum Cost Calculation - Vogel Approximation Method(VAM

State and Prove the Arden's theorem for Regular Expression

Different types of applications and numerous programming languages have been developed to make easy the task of writing programs. The assortment of programming languages shows, dif