McqMate

Q. |
## A language L is accepted by a FSA iff it is |

A. | CFL |

B. | CSL |

C. | Recursive |

D. | Regular |

Answer» D. Regular |

702

0

Do you find this helpful?

1

View all MCQs in

Theory of ComputationNo comments yet

- 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.
- 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?
- The minimum state automaton equivalent to the above FSA has the following number of states
- The concept of FSA is much used in this part of the compiler
- 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.
- The language accepted by a Push down Automata:
- Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
- The language accepted by a Push down Automata:
- Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression