aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Online Test 1 - Compiler | Computer Science(CS)
  • The language recognized by the following finite automatio...
Multiple choice

The language recognized by the following finite automation is

  1. aabb* + bab*

  2. (aab) (empty + (bab))

  3. (aa + empty) (b + ba) (bab)*

  4. (aab + ba) (bab)*
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Start A to accept $\epsilon$ $r_1 = (aan + ba)$ $\epsilon$ to C & D $r_2 = (bab)^$ $r = r_1r_2 = (aab + ba)(bab)^$

Keep practicing — related questions

  • Consider the following Finite State Automaton: ![](https://i.imgur.com/GhEmXMY.png) The language accepted b...
  • Consider the following Finite State Automaton: ![](https://i.imgur.com/GhEmXMY.png) The language accepted b...
  • Consider the machine M ![](https://i.imgur.com/2BYmx6r.png) The language recognized by M is
  • A deterministic finite automation DFAD with alphabet $\sum$ is given below: ![](https://i.imgur.com/PIneOHT...
  • The language accepted by a Pushdown Automaton in which the stack is limited to 10 items is best described as
  • The binary language consists of _________ digit(s).
  • Directions: The following question tests your ability to recognize grammar and usage errors. The sentence c...
  • Directions: In the following question, a statement is followed by two assumptions I and II. You are to cons...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy