Non - sl languages, Theory of Computation

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 that establishes it is based on the properties of a Myhill graph that we know must exist, those properties are properties of Myhill graphs in general and don't depend on the speci?cs of that particular graph. This lets us reason about the strings in an SL2 language without having to actually produce the automaton that recognizes it. Perhaps more importantly, it lets us establish that a particular language is not SL2 by supposing (counterfactually) that it was SL2 and showing that Suffx Substitution Closure would then imply that it included strings that it should not.

Posted Date: 3/21/2013 6:11:15 AM | Location : United States

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

Write discussion on Non - sl languages
Your posts are moderated
Related Questions
#can you solve a problem of palindrome using turing machine with explanation and diagrams?

Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima

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 part

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

The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

how to understand DFA ?

Exercise Show, using Suffix Substitution Closure, that L 3 . L 3 ∈ SL 2 . Explain how it can be the case that L 3 . L 3 ∈ SL 2 , while L 3 . L 3 ⊆ L + 3 and L + 3 ∈ SL

The Recognition Problem for a class of languages is the question of whether a given string is a member of a given language. An instance consists of a string and a (?nite) speci?cat

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