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

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

Decision Theroy, spam messages h= 98%, m= 90%, l= 80% non spam h=12%, m = 8...

spam messages h= 98%, m= 90%, l= 80% non spam h=12%, m = 8%, l= 5% The organization estimates that 75% of all messages it receives are spam messages. If the cost of not blocking a

Operator p, implementation of operator precedence grammer

implementation of operator precedence grammer

Non-regular languages, Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = ...

Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

Designing finite automata, a finite automata accepting strings over {a,b} e...

a finite automata accepting strings over {a,b} ending in abbbba

Turing machine, Can v find the given number is palindrome or not using turi...

Can v find the given number is palindrome or not using turing machine

Defining strictly local automata, One of the first issues to resolve, when ...

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

# Help, #Your company has 25 licenses for a computer program, but you disco...

#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take an

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