Theory of Computation Regular Languages and Finite Automata Regular Languages

Consider the regular language L = (aaa + aaaaa)*. Let x be the total number of final states and y be the total number states in a minimal DFA. Find y – x?

Enter numerical value using the virtual keypad. Round off where necessary.

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