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
This was one of the ?rst substantial theorems of Formal Language Theory. It's maybe not too surprising to us, as we have already seen a similar equivalence between LTO and SF. But

Automata and Compiler (1) [25 marks] Let N be the last two digits of your student number. Design a finite automaton that accepts the language of strings that end with the last f

a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le

c program to convert dfa to re

The generalization of the interpretation of strictly local automata as generators is similar, in some respects, to the generalization of Myhill graphs. Again, the set of possible s



Theorem The class of ?nite languages is a proper subclass of SL. Note that the class of ?nite languages is closed under union and concatenation but SL is not closed under either. N

Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.

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