Myhill-nerode theorem, Theory of Computation

Assignment Help:

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL2 to discover properties of the recognizable languages. Because they are SL2 languages, the runs of an automaton A (and, equivalently, the strings of pairs licensed by G2A) will satisfy the 2-suffix substitution closure property. This means that every recognizable language L is a homomorphic image of some language L′ (over an alphabet Σ′ , say) for which

                                                             u′1σ′v′1 ∈ L′ and u′2 σ′v′2 ∈ L′⇒ u′1σ′v′2( and u′2σ′v′1) ∈ L′.

Moreover, u′1σ′v′1 ∈ L′ and u′1σ′v′2 ∈ L′⇒ u′2σ′v′2 ∈ L′

The hypothetical u′1σ′ and u′2σ′ are indistinguishable by the language. Any continuation that extends one to a string in L′ will also extend the other to a string in L′ ; any continuation that extends one to a string not in L′ will extend the other to a string not in L′.

For the SL2 language L′ the strings that are indistinguishable in this way are marked by their ?nal symbol. Things are not as clear for the recognizable language L because the homomorphism may map many symbols of Σ′ to the same symbol of Σ. So it will not generally be the case that we can easily identify the sets of strings that are indistinguishable in this way. But they will, nevertheless, exist. There will be pairs of strings u1 and u2 - namely the homomorphic images of the pairs u′1σ′ and u′2σ′-for which any continuation v, it will be the case that u1v ∈ L iff u2v ∈ L.

This equivalence between strings (in the sense of being indistinguishable by the language in this way) is the key to characterizing the recognizable languages purely in terms of the strings they contain in a way analogous to the way suffix substitution closure characterizes the SL2.


Related Discussions:- Myhill-nerode theorem

Regular expressions, The project 2 involves completing and modifying the C+...

The project 2 involves completing and modifying the C++ program that evaluates statements of an expression language contained in the Expression Interpreter that interprets fully pa

Local and recognizable languages, We developed the idea of FSA by generaliz...

We developed the idea of FSA by generalizing LTk transition graphs. Not surprisingly, then, every LTk transition graph is also the transition graph of a FSA (in fact a DFA)-the one

Local suffix substitution closure, The k-local Myhill graphs provide an eas...

The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo

Closure properties to prove regularity, The fact that regular languages are...

The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations

Discrete math, Find the Regular Grammar for the following Regular Expressio...

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

Context free grammar, A context free grammar G = (N, Σ, P, S)  is in binary...

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 Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd