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
Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

The key thing about the Suffx Substitution Closure property is that it does not make any explicit reference to the automaton that recognizes the language. While the argument tha

spam messages h= 98%, m= 90%, l= 80% non spam h=12%, m = 8%, l= 5% The organization estimates that 75% of all messages it receives are spam messages. If the cost of not blocking a

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

Design a turing machine to compute x + y (x,y > 0) with x an y in unary, seperated by a # (descrition and genereal idea is needed ... no need for all TM moves)

A Turing machine is a theoretical computing machine made-up by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine having of a line of

. On July 1, 2010, Harris Co. issued 6,000 bonds at $1,000 each. The bonds paid interest semiannually at 5%. The bonds had a term of 20 years. At the time of issuance, the market r

In Exercise 9 you showed that the recognition problem and universal recognition problem for SL2 are decidable. We can use the structure of Myhill graphs to show that other problems

Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

And what this money. Invovle who it involves and the fact of,how we got itself identified candidate and not withstanding time date location. That shouts me media And answers who''v