Question: What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
Options
A : L must be {an| n is odd}
B : L must be {an| n is even}
C : L must be {an| n is even}
D : Either L must be {an | n is odd}, or L must be {an | n is even}
Compilers Obtaining Regular Expression From Finite Automata 1 more questions
The length of member should be _________ for a short....
Which frequency band is used for connecting the satellite system....
Identify the given type of joint in Concrete Structures.
Which of these is not a cylinder head type of....
Which among the following cannot be accepted by a regular....
Series electromagnet consists of _________
The rectangular type of C.T. is built of _________
The material balance optimization is also referred as
Which two parameters given below are zero in the lossless....
To conduct the open circuit test, test is conducted on....
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Nfa Epsilon Moves Dfa 1
Compilers Non Deterministic Finite Automata 1