Skip to content

MCQsHubPakistan

Categories Quizzes Papers Leaderboard

Theory of Computation (Automata) — Page 2

Practice Theory of Computation (Automata) MCQs for Pakistan exams (CSS, FPSC, PPSC, NTS) — 50 practice questions with answers and explanations.

The concept in which a Turing machine capable of simulating any other Turing machine given its description and input is best known as which of these terms?
Identify the correct definition of Universal Turing machine.
What term describes the following? a property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language.
In computer science, Pumping lemma refers to which of the following?
Select the correct name for: a finite-state machine whose output values are determined solely by its current state.
Which term refers to an abstract machine with a finite number of states used to recognize patterns in input strings?
What does Finite automaton refer to?
What is the name for a finite automaton where each state has exactly one transition for each possible input symbol?
Which of the following best describes Deterministic finite automaton (DFA)?
Identify the correct concept described as: a finite automaton that may have multiple possible transitions for a given state and input symbol.
Non-deterministic finite automaton (NFA) is best defined as which of the following?
A sequence of characters that defines a search pattern, corresponding to regular languages. What is this concept called?
Choose the correct description of Regular expression.
Which of the following best names the concept in which an automaton that uses a stack to recognize context-free languages?
What is the function or purpose of Pushdown automaton?
The concept in which an abstract computational model that manipulates symbols on an infinite tape according to a set of rules is best known as which of these terms?
Identify the correct definition of Turing machine.
What term describes the following? a formal grammar in which every production rule has a single non-terminal on its left-hand side.
In computer science, Context-free grammar refers to which of the following?
Select the correct name for: a language that can be expressed using a regular expression or recognized by a finite automaton.

Previous 1 2 3 Next

MCQsHub

Free MCQs for Pakistan exam prep — CSS, FPSC, PPSC, NTS, and more.

Browse categories Past papers Leaderboard Submit an MCQ Upload a paper

© 2026 MCQsHub