Computer Sciences > Gate 2022 > Finite Automata
Which one of the following regular expressions correctly represents the language
of the finite automaton given below?
Correct : d
Similar Questions
A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
Total Unique Visitors
Loading......