in Theory of Computation
391 views
1 vote
1 vote
Let L1 and L2 are two languages over Σ={a} such that:
L1 ={ax | x is even}
L2 ={ax | x is odd}
Then select the correct option

Options:
  1.L1∙L2 = L1
  2.None of the above is correct
  3.L1∙L2≠L2∙L1
  4.L1∙L2 is Σ*

 

 

----------------------------

I think the answer should be (4).

As after concatenation they whole machine will take both (even as well as odd)
in Theory of Computation
391 views

2 Comments

None is correct.

L1.L2 = L2.L1 = L2

And after concatination we never get epsilon.
2
2

I am not able to draw their concatenation.

Can u please post the diagram?

Or is there any other method?

0
0

Please log in or register to answer this question.