Theory of Computation Regular Languages and Finite Automata

Which one of the following strings is not accepted by the finite automaton described by the regular expression (0 + (1(01∗0) ∗1)) ∗?

1

1100100011011001011

2

0110100010111010010

3

0100011010111010101

4

1101001101100010011

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