Union, Theory of Computation

Assignment Help:

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.


Related Discussions:- Union

Computation and languages, When we study computability we are studying prob...

When we study computability we are studying problems in an abstract sense. For example, addition is the problem of, having been given two numbers, returning a third number that is

Transition and path functions, When an FSA is deterministic the set of trip...

When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

Pumping lemma constant, a) Let n be the pumping lemma constant. Then if L i...

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

Can you help me in automata questions, i have some questions in automata, c...

i have some questions in automata, can you please help me in solving in these questions?

CNF, S-->AAA|B A-->aA|B B-->epsilon

S-->AAA|B A-->aA|B B-->epsilon

Discrete math, Find the Regular Grammar for the following Regular Expressio...

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

Emptiness problem, The Emptiness Problem is the problem of deciding if a gi...

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

Automata and compiler, Automata and Compiler (1) [25 marks] Let N be the...

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

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