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

Project, can you plz help with some project ideas relatede to DFA or NFA or...

can you plz help with some project ideas relatede to DFA or NFA or anything

What is pumping lemma for regular sets, State & prove pumping lemma for reg...

State & prove pumping lemma for regular set. Show that for the language L={ap |p is a prime} is not regular

Prism algorithm, what exactly is this and how is it implemented and how to ...

what exactly is this and how is it implemented and how to prove its correctness, completeness...

Prepare the consolidated financial statements, Prepare the consolidated fin...

Prepare the consolidated financial statements for the year ended 30 June 2011. On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , J

Equivalence of nfas and dfas, In general non-determinism, by introducing a ...

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis

Graph Connectivity, Let G be a graph with n > 2 vertices with (n2 - 3n + 4)...

Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.

Transition graphs, We represented SLk automata as Myhill graphs, directed g...

We represented SLk automata as Myhill graphs, directed graphs in which the nodes were labeled with (k-1)-factors of alphabet symbols (along with a node labeled ‘?' and one labeled

Formal languages and grammar, The universe of strings is a very useful medi...

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

IT PRoject Management, What are the benefits of using work breakdown struct...

What are the benefits of using work breakdown structure, Project Management

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