397 views
2 votes
2 votes

WHat is the union of the following  wo languages

  • L=0*1+0+1*    ∪    10*1
  • L=001   U   0*1* 

1 Answer

0 votes
0 votes

Steps to find union of two regular languages is 

  1. construct the DFA of both regular expression
  2. Find the union of both DFA's
  3. find the resultant regular expression

The answer for above question is 

A.100*1

B.001

Related questions

2 votes
2 votes
0 answers
1
sunil sarode asked Jan 19, 2018
1,694 views
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...
0 votes
0 votes
1 answer
2
iarnav asked Sep 15, 2017
576 views
L={an∣n≥0} U {anbn∣n≥0}What will be the result? How's it's DCFL? Please explain with an example! Thanks