Define Pushdown automata

Pushdown Automata is a finite automata with extra memory called stack which helps
Pushdown automata to recognize Context Free Languages. A Pushdown Automata (PDA)
can be defined as : Q is the set of states. ∑is the set of input symbols
what is ambiguity in theory of computation

Data Structure AlgorithmsComputer ScienceComputers. A grammar is said to be

ambiguous if there exists more than one left most derivation or more than one right
most derivation or more than one parse tree for a given input string.

Define context free grammar. 2

CFG stands for context-free grammar. It is is a formal grammar which is used to generate
all possible patterns of strings in a given formal language. Context-free grammar G can be
defined by four tuples as: G = (V, T, P, S)

Define DFA
DFA refers to deterministic finite automata. Deterministic refers to the uniqueness of the
computation. The finite automata are called deterministic finite automata if the machine is
read an input string one symbol at a time. In DFA, there is only one path for specific input
from the current state to the next state.

Define DFA
FA stands for non-deterministic finite automata. It is easy to construct an NFA when
compared to DFA for a given regular language. The finite automata are called NFA when
there exist many paths for specific input from the current state to the next state.
What is the condition required for generalized nondeterministic finite automaton?
For convenience, we require that GNFAs always have a special formthat meets
the following conditions.
• The start state has transition arrows going to every other state but no arrows

coming in from any other state.

• There is only a single accept state, and it has arrows coming in from every

other state but no arrows going to any other state. Furthermore, the accept
state is not the same as the start state.
• Except for the start and accept states, one arrow goes from every state to

every other state and also from each state to itself.

Prerequisite – Turing Machine
1. Multiple track Turing Machine:

• A k-track Turing machine(for some k>0) has k-tracks and one R/W
head that reads and writes all of them one by one.
• A k-track Turing Machine can be simulated by a single track Turing
machine
2. Two-way infinite Tape Turing Machine:

• Infinite tape of two-way infinite tape Turing machine is unbounded

in both directions left and right.
• Two-way infinite tape Turing machine can be simulated by one-way
infinite Turing machine(standard Turing machine).
3. Multi-tape Turing Machine:

• It has multiple tapes and is controlled by a single head.

• The Multi-tape Turing machine is different from k-track Turing
machine but expressive power is the same.
• Multi-tape Turing machine can be simulated by single-tape Turing
machine.
4. Multi-tape Multi-head Turing Machine:

• The multi-tape Turing machine has multiple tapes and multiple

heads
 • Each tape is controlled by a separate head
• Multi-Tape Multi-head Turing machine can be simulated by a
standard Turing machine.
5. Multi-dimensional Tape Turing Machine:

• It has multi-dimensional tape where the head can move in any

direction that is left, right, up or down.
• Multi dimensional tape Turing machine can be simulated by one-
dimensional Turing machine
6. Multi-head Turing Machine:

• A multi-head Turing machine contains two or more heads to read

the symbols on the same tape.
• In one step all the heads sense the scanned symbols and move or
write independently.
• Multi-head Turing machine can be simulated by a single head
Turing machine.
7. Non-deterministic Turing Machine:

• A non-deterministic Turing machine has a single, one-way infinite

tape.
• For a given state and input symbol has at least one choice to move
(finite number of choices for the next move), each choice has
several choices of the path that it might follow for a given input
string.
• A non-deterministic Turing machine is equivalent to the
deterministic Turing machine.