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
prove following function is turing computable? f(m)={m-2,if m>2, {1,if

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

what problems are tackled under numerical integration

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

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

Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1''s encountered is even or odd.

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

c program to convert dfa to re

Application of the general suffix substitution closure theorem is slightly more complicated than application of the specific k-local versions. In the specific versions, all we had

shell script to print table in given range