Question
Name X?
a.
Push Down Automata
b.
Non deterministic Finite Automata
c.
Turing machines
d.
None of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding...
Similar Questions
Discover Related MCQs
Q. Which of the following is/are not an application of turing machine?
View solution
Q. State true or false:
Statement: Turing Machine can change symbols on its tape, whereas the FA cannot change symbols on tape.
View solution
Q. Which of the following cannot be a possibility of a TM while it processes an input?
View solution
Q. Pick the odd one out.
View solution
Q. Which among the following is not true for 2-way infinte TM?
View solution
Q. Can a turing machine act like a transducer?
View solution
Q. Enumerator is a turing machine with __________
View solution
Q. For the following language, an enumerator will print:
L={a^nb^n|n>=0}
View solution
Q. Complete the following statement:
Statement : A language is turing recognizable if an only if ___________
View solution
Q. Can a single tape turing machine be simulated using deterministic 2-stack turing machine?
View solution
Q. A ___________ is a multi tape turing machine whose input tape is read only.
View solution
Q. Instantaneous description of a counter machine can be described using:
View solution
Q. Which of the following parameters cannot be used to restrict a turing machine?
View solution
Q. Linear Bounded Automaton is a:
View solution
Q. State true or false:
Statement: Using a two track tape, we can use a semi infinite tape to simulate an infinte tape.
View solution
Q. Which of the following is true with reference to semi-infinite tape using a two track tape?
View solution
Q. Which among the following options are correct?
Statement 1: TMs can accept languages that are not accepted by any PDA with one stack.
Statement 2: But PDA with two stacks can accept any language that a TM can accept.
View solution
Q. A two-way infinite tape turing machine is ________ superior than the basic model of the turing machine in terms of power.
View solution
Q. For a basic turing machine, there exists an equivalent :
View solution
Q. Fill in the blank with an appropriate option.
In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
