- Computer Science Engineering (CSE)
- Theory of Computation
- Unit 1
- Regular expressions are

Q. |
## Regular expressions are |

A. | Type 0 language |

B. | Type 1 language |

C. | Type 2 language |

D. | Type 3 language |

Answer» A. Type 0 language |

View all MCQs in:
Theory of Computation

- 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?
- Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
- Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?
- A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
- 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.
- Languages are proved to be regular or non regular using pumping lemma.
- If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
- If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
- P, Q, R are three languages. If P & R are regular and if PQ=R, then
- 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.

Login to Continue

It will take less than 2 minutes

Report MCQ