[Solved] Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states?

Computer Science Engineering (CSE)
Theory of Computation
Unit 1
Which one of the following statement is ...

Q.	Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states?
A.	L must be either {an I n is odd} or {an I n is even}
B.	L must be {an I n is odd}
C.	L must be {an I n is even}
D.	L must be {an I n = 0}
Answer» A. L must be either {an I n is odd} or {an I n is even}

View all MCQs in: Theory of Computation

Discussion

Related Questions

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below: A B P - Q q R S r R S s R S The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
Which of the following is true with respect to Kleene’s theorem? 1 A regular language is accepted by a finite automaton. 2 Every language is accepted by a finite automaton or a turingmachine.
Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.
A minimum state deterministic finite automation accepting the language L={W W ε {0,1}*, number of 0s and 1s in are divisible by 3 and 5, respectively} has
A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has
Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet Σ?
How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?
Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?
Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression