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?

distinguish between histogram and historigram

how many pendulum swings will it take to walk across the classroom?

A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

write grammer to produce all mathematical expressions in c.

The Universality Problem is the dual of the emptiness problem: is L(A) = Σ∗? It can be solved by minor variations of any one of the algorithms for Emptiness or (with a little le

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

Claim Under the assumptions above, if there is an algorithm for checking a problem then there is an algorithm for solving the problem. Before going on, you should think a bit about

Define the following concept with an example: a.    Ambiguity in CFG b.    Push-Down Automata c.    Turing Machine