Union, Theory of Computation

Intuitively, closure of SL2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a path through the intersection of the graphs (by which we mean the graph resulting by taking the intersection of the vertex sets and the intersection of the edge sets).

For the union, on the other hand, the corresponding construction won't work. An automaton built from the union of the two automata will still recognize all of the strings in L1 and all of the strings in L2, but it is likely to also recognize strings made up of adjacent pairs from L1 combined with adjacent pairs from L2 that aren't in either language. And, in fact, we can use Suffx Substitution Closure to show that there are languages that are the union of two SL2 languages that are not, themselves, SL2.

Posted Date: 3/22/2013 12:49:44 AM | Location : United States







Related Discussions:- Union, Assignment Help, Ask Question on Union, Get Answer, Expert's Help, Union Discussions

Write discussion on Union
Your posts are moderated
Related Questions
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

Describe the architecture of interface agency

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

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

design an automata for strings having exactly four 1''s

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

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 tha

Kleene called this the Synthesis theorem because his (and your) proof gives an effective procedure for synthesizing an automaton that recognizes the language denoted by any given r

For every regular language there is a constant n depending only on L such that, for all strings x ∈ L if |x| ≥ n then there are strings u, v and w such that 1. x = uvw, 2. |u

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.