Theory of Computation (Automata)
Practice Theory of Computation (Automata) MCQs for Pakistan exams (CSS, FPSC, PPSC, NTS) — 50 practice questions with answers and explanations.
How to use these questions
Theory of Computation (Automata) on MCQsHub is 50 published questions for Pakistan exams such as CSS, FPSC, PPSC, and NTS. Open a question, choose an option, then read the explanation before you move on. The explanation names the correct choice and why the other options do not fit. Difficulty labels and topic tags show which idea to revise next, instead of repeating questions you already know.
Previous and next links on each question page stay inside Theory of Computation (Automata), so you can work through the subject without returning to this index. Subtopics listed here belong to the same subject and narrow the set. When you want a clock and a score, start a timed quiz for Theory of Computation (Automata). When you want a whole sitting rather than one question, open the past-paper library. New Theory of Computation (Automata) questions appear here after editorial review.
The list below starts with the newest Theory of Computation (Automata) questions. Later pages keep the same subject. Each title is a link to the full stem, the options, and the explanation.
1 2 3 Next All questions Full list of questions in this category for browsing.
The concept in which a finite sequence of symbols drawn from an alphabet is best known as which of these terms... Identify the correct definition of String (formal language). What term describes the following? a set of strings composed of symbols from a defined alphabet. In computer science, Formal language refers to which of the following? Select the correct name for: an operation on a set of symbols or strings that produces the set of all possible... Which statement correctly explains Kleene star? Which concept is defined as follows: a transition in a non-deterministic automaton that occurs without consumi... What is Epsilon transition primarily used for? The following statement describes a specific concept. What is it called? a class of formal languages recognize... Select the accurate description of Context-sensitive language. Which term refers to a class of languages for which a Turing machine will accept and halt on strings in the la... What does Recursively enumerable language refer to? What is the name for the concept where a DFA and an NFA are considered equivalent because they recognize exact... Which of the following best describes DFA-NFA equivalence? Identify the correct concept described as: the process of reducing a deterministic finite automaton to the sma... DFA minimization is best defined as which of the following? The sequence of production rule applications used to generate a string from a grammar's start symbol. What is... Choose the correct description of Derivation. Which of the following best names the concept in which a grammar for which some string can be generated by mor... What is the function or purpose of Ambiguous grammar? The concept in which a Turing machine capable of simulating any other Turing machine given its description and... 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... 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 s... Which term refers to an abstract machine with a finite number of states used to recognize patterns in input st... 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 sy... 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... 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 conce... 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-fre... 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... 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 o... 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 fi... Which statement correctly explains Regular language? Which concept is defined as follows: the undecidable problem of determining whether a given program will finis... What is Halting problem primarily used for? The following statement describes a specific concept. What is it called? a classification of formal grammars i... Select the accurate description of Chomsky hierarchy. Which term refers to a property of a problem indicating whether an algorithm can be constructed that always pr... What does Decidability refer to? What is the name for a finite, non-empty set of symbols used to construct strings in a formal language? Which of the following best describes Alphabet? Identify the correct concept described as: a visual representation showing how an automaton moves between stat...