MCQ Collection
Theory of Automata & Formal Languages MCQs
MCQs on automata theory, grammars, regular languages, and formal language concepts.
Choose an option to check your answer.
A.
a regular expression operator
B.
a single finite state
C.
a fixed-size stack only
D.
an unbounded storage medium divided into cells
Show Answer
Correct Answer: D. an unbounded storage medium divided into cells
Explanation:
TM tape is correctly described as an unbounded storage medium divided into cells.
Choose an option to check your answer.
A.
a special type of regular expression
B.
a stack-only grammar
C.
a simple abstract computing model related to Turing machine computation
D.
a finite automaton with output only
Show Answer
Correct Answer: C. a simple abstract computing model related to Turing machine computation
Explanation:
Post machine is correctly described as a simple abstract computing model related to Turing machine computation.
Choose an option to check your answer.
A.
the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
B.
a method for database indexing
C.
a programming language syntax only
D.
a list of all compiler phases
Show Answer
Correct Answer: A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
Explanation:
In this course context, Chomsky hierarchy means the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.
Choose an option to check your answer.
A.
a single finite state
B.
a fixed-size stack only
C.
a regular expression operator
D.
an unbounded storage medium divided into cells
Show Answer
Correct Answer: D. an unbounded storage medium divided into cells
Explanation:
In this course context, TM tape means an unbounded storage medium divided into cells.
Choose an option to check your answer.
A.
a special type of regular expression
B.
a simple abstract computing model related to Turing machine computation
C.
a finite automaton with output only
D.
a stack-only grammar
Show Answer
Correct Answer: B. a simple abstract computing model related to Turing machine computation
Explanation:
In this course context, Post machine means a simple abstract computing model related to Turing machine computation.
Choose an option to check your answer.
A.
the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
B.
a method for database indexing
C.
a list of all compiler phases
D.
a programming language syntax only
Show Answer
Correct Answer: A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
Explanation:
The suitable explanation is the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.
Choose an option to check your answer.
A.
a fixed-size stack only
B.
a single finite state
C.
an unbounded storage medium divided into cells
D.
a regular expression operator
Show Answer
Correct Answer: C. an unbounded storage medium divided into cells
Explanation:
The suitable explanation is an unbounded storage medium divided into cells.
Choose an option to check your answer.
A.
a special type of regular expression
B.
a stack-only grammar
C.
a simple abstract computing model related to Turing machine computation
D.
a finite automaton with output only
Show Answer
Correct Answer: C. a simple abstract computing model related to Turing machine computation
Explanation:
The suitable explanation is a simple abstract computing model related to Turing machine computation.
Choose an option to check your answer.
A.
a grammar that generates regular languages
B.
a grammar with an unrestricted left side
C.
a grammar that always has ambiguous parse trees
D.
a grammar that generates only undecidable languages
Show Answer
Correct Answer: A. a grammar that generates regular languages
Explanation:
The correct answer is a grammar that generates regular languages.
Choose an option to check your answer.
A.
a DFA final state only
B.
the set of all terminals
C.
the component that reads, writes, and moves on the tape
D.
the start symbol of a grammar
Show Answer
Correct Answer: C. the component that reads, writes, and moves on the tape
Explanation:
The correct answer is the component that reads, writes, and moves on the tape.
Choose an option to check your answer.
A.
a model that recognizes only finite languages
B.
a TM variant with more than one tape but equivalent in computational power to a standard TM
C.
a model without states
D.
a model more powerful than all TMs
Show Answer
Correct Answer: B. a TM variant with more than one tape but equivalent in computational power to a standard TM
Explanation:
The correct answer is a TM variant with more than one tape but equivalent in computational power to a standard TM.
Choose an option to check your answer.
A.
a grammar with an unrestricted left side
B.
a grammar that generates only undecidable languages
C.
a grammar that generates regular languages
D.
a grammar that always has ambiguous parse trees
Show Answer
Correct Answer: C. a grammar that generates regular languages
Explanation:
regular grammar is correctly described as a grammar that generates regular languages.
