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 lets us do this by considering the characteristics of the tilings they build. Consider, for instance the situation in the top half of Figure 5, where there are two tilings u₁σv₁ and u₂σv₂ in which the symbol ‘σ' occurs. Clearly, after having built u₁σ we had the choice of continuing with either v₁ or with v₂. We had the same choice after having built u₂σ. Hence both of the tilings in the bottom half are constructable as well.

What this means for the strings, is that the question of whether we can extend a particular string to produce a longer string that is in the language depends only on the last symbol of that string.

Posted Date: 3/21/2013 6:09:41 AM | Location : United States

Ask an Expert

Related Discussions:- Suffix substitution closure, Assignment Help, Ask Question on Suffix substitution closure, Get Answer, Expert's Help, Suffix substitution closure Discussions

Write discussion on Suffix substitution closure
Your posts are moderated

Write your message here..

Related Questions

Multiple instruction single data stream, short application for MISD short application for MISD

Gephi, construct a social network from the real-world data, perform some si... construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

Example of finite state automaton, The initial ID of the automaton given in... The initial ID of the automaton given in Figure 3, running on input ‘aabbba' is (A, aabbba) The ID after the ?rst three transitions of the computation is (F, bba) The p

Decision problems, In Exercise 9 you showed that the recognition problem an... 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

Language accepted by a nfa, The language accepted by a NFA A = (Q,Σ, δ, q 0... The language accepted by a NFA A = (Q,Σ, δ, q 0 , F) is NFAs correspond to a kind of parallelism in the automata. We can think of the same basic model of automaton: an inpu

Two-tape turing machine, Let there L1 and L2 . We show that L1 ∩ L2 is CFG ... 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

Automaton for finite languages, We can then specify any language in the cla... We can then specify any language in the class of languages by specifying a particular automaton in the class of automata. We do that by specifying values for the parameters of the

Myhill graph of the automaton, Exercise:  Give a construction that converts... Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

Programming languages, Different types of applications and numerous program... 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

First model of computation, Computer has a single unbounded precision count... 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