Theory of Computation Regular Languages and Finite Automata Finite Automata

let x be number of final states and y be number of total states present in minimal deterministic finite automaton for the language \(L = {\rm{\{ }}\;{a^n}\;{\rm{|}}\;n\; \ge 0\;,\;n \ne 5\}\). Find the value of xy?

1
56
2
65
3
67
4
76

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