Start learning →

GATE CSE Automata — practice questions

Explore 1 free Automata questions in GATE CSE Theoryofcomputation. Open each question or exercise to read its content, reference answers and available explanation.

Practise Automata with Quill →

Automata questions and exercises with answers

Showing questions 1–1 of 1.

Match the language class to its recognising machineRead the answer and worked solution →

Worked practice questions

Match the language class to its recognising machine

Read exercise and reference answers
Matching pairs
  1. Left
    Regular
    Right
    Finite Automaton (DFA/NFA)
  2. Left
    Context-Free
    Right
    Pushdown Automaton
  3. Left
    Context-Sensitive
    Right
    Linear Bounded Automaton
  4. Left
    Recursive
    Right
    Turing Machine (halts)
  5. Left
    Recursively Enumerable
    Right
    Turing Machine (may not halt)

Open this exercise →

How to practise

  1. Choose a Automata question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Theoryofcomputation topics

DecidabilityRegularlanguages