Theory of Computation Regular Languages and Finite Automata Finite Automata

Minimum Number of states require to accept string ends with 101.

1
3
2
2
3
1
4
can’t be represented
5
Question Not Attempted

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