Register

Union

195 views

1 Answer

0 votes
0 votes
In a very simple manner, if you want to draw a transition diagram, draw transition diagram for both regular expression and join them using a start state. resulting diagram may be further simplified.

Now, in order to calculate union of above two just rewrite regular expresson using simplifed diagram that will give union regular expression . Hope this will work for you.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
3
sunil sarode asked Jan 19, 2018
1,769 views
Union of two DCFL is ?
Consider two languages LA and LB over Σ={a,b}. LA= {a^ib^ja^k | i,j,k ≥ 0 and j=i+k} LB= {b^ia^jb^k | i,j,k ≥ 0 and j=i+k} Then ( LA ∪ LB ) is : A DCFL but not regular B CFL but not DCFL C None of the above D CSL but not CFL
Consider two languages LA and LB over Σ={a,b}.LA= {a^ib^ja^k | i,j,k ≥ 0 and j=i+k}LB= {b^ia^jb^k | i,j,k ≥ 0 and j=i+k} Then ( LA ∪ LB ) is : A DCFL but not regul...
User Avatar
8 votes
8 votes
0 answers
4
Hemant Parihar asked Dec 2, 2017
2,052 views
Infinite union of regular languages.
Let L1,L2,L3..... are infinite sequence of regular languages. $L=\bigcup_{i=1}^{\propto }L_{i}$ which of the following statements is true? A. L is always regular B. L is always context free C. L is always recursive D. It can be a non recursively enumerable language
Let L1,L2,L3..... are infinite sequence of regular languages.$L=\bigcup_{i=1}^{\propto }L_{i}$ which of the following statements is true?A. L is always regularB. L is alw...
User Avatar
Link Copied!