Theory of Computation Regular Languages and Finite Automata Regular Languages

(0 + ε)(1 + ε) represents:

1

{0, 1, 01, ε}

2

{0, 1, ε}

3

{0, 1, 01, 11, 00, 10, ε}

4

{0, 1}

Sponsored

hivanix.in

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