Theory of Computation Regular Languages and Finite Automata Regular Languages

Which of the following is/are not equivalent regular expressions?

1
(10 + 01)* and (01)* + (11)*
2
((01)*(10)*)* and (10 + 01)*
3
(01)* + (11)* and (0* + (11)* + 0*)*)
4
((01)*(10)*)* and (0* + (11)* + 0*)*)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters