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?
Consider the following deterministic finite automaton (DFA) defined over the alphabet, Σ={a,b}. Identify which of the following language(s) is/are accepte...
Let Σ={1,2,3,4}. For x∈Σ*, let prod(x) be the product of symbols in x modulo 7. We take prod(ε)=1, where ε is the null string.F...
Total Unique Visitors
Loading......