Theory of Computation Regular Languages and Finite Automata Finite Automata

The number of states in a minimal Deterministic finite automata (DFA) that accepts the given language L = { 0p1q2r | p,q,r>=1} is

1
4
2
3
3
5
4
6

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