Scribd
Upload
32 views5 pages

Pushdown Automata Is A Finite Automata With Extra Memory Called - 1

Pushdown automaa

Uploaded by

horn blow
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views5 pages

Pushdown Automata Is A Finite Automata With Extra Memory Called - 1

Pushdown automaa

Uploaded by

horn blow
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

**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
● Γ is the set of pushdown symbols (which can be pushed and popped from stack)
● q0 is the initial state
● Z is the initial pushdown symbol (which is initially present in stack)
● F is the set of final states.
4
*Automata theory (also known as Theory Of Computation) is a theoretical branch of Computer
3
Science and Mathematics, which mainly deals with the logic of computation with respect to
2
simple machines, referred to as automata. Automata*
1
enables scientists to understand how machines compute the functions and solve problems. The
main motivation behind developing Automata Theory was to develop methods to describe and
analyze the dynamic behavior of discrete systems.

* The Turing machine is a real and theoretical computer that can be used to explore the limits
and extent of computing real numbers. The input is written on tape that the machine reads, and
contains a finite number of non-empty cells, a control head in an initial state, and a set of
instructions for the preceding states.
There are various features of the Turing machine:
. It has an external memory which remembers arbitrary long sequence of input.
. It has unlimited memory capability.
. The model has a facility by which the input at left or right on the tape can be read easily.
. The machine can produce a certain output based on its input. Sometimes it may be
required that the same input has to be used to generate the output. So in this machine, the
distinction between input and output has been removed.
* Difference between DFA and NFA :

DFA NFA
DFA stands for Deterministic Finite NFA stands for Nondeterministic
Automata. Finite Automata.
For each symbolic representation No need to specify how does the
of the alphabet, there is only one NFA react according to some
state transition in DFA. symbol.
DFA cannot use Empty String NFA can use Empty String
transition. transition.
DFA can be understood as one NFA can be understood as
machine. multiple little machines computing
at the same time.
In DFA, the next possible state is In NFA, each pair of state and
distinctly set. input symbol can have many
possible next states.
DFA is more difficult to construct. NFA is easier to construct.
DFA rejects the string in case it NFA rejects the string in the event
terminates in a state that is of all branches dying or refusing
different from the accepting state. the string.
Time needed for executing an Time needed for executing an
input string is less. input string is more.
All DFA are NFA. Not all NFA are DFA.
**

Deterministic Algorithm Non-deterministic Algorithm


A deterministic algorithm is one A non-deterministic algorithm is
whose behavior is completely one in which the outcome cannot
determined by its inputs and the be predicted with certainty, even if
sequence of its instructions. the inputs are known.
For a particular input, the For a particular input the
computer will give always the computer will give different
same output. outputs on different execution.
Can solve the problem in Can’t solve the problem in
polynomial time. polynomial time.
Can determine the next step of Cannot determine the next step of
execution. execution due to more than one
path the algorithm can take.
Operation are uniquely defined. Operation are not uniquely
defined.
Like linear search and binary like 0/1 knapsack problem.
search
Deterministic algorithms usually Time complexity of non-
have a well-defined worst-case deterministic algorithms is often
time complexity. described in terms of expected

*The Pumping Lemma is a tool in formal language theory that demonstrates the non-regularity of
certain languages. For example, it shows that the language {0^n1^n} is not regular.
3) What is transition System or graph?
A transition graph or a transition system is a finite directed labelled graph in which each vertex
(or node) represents a state and the directed edges indicate the transition of a state and the
edges are labelled with input\output.
A typical transition system is shown in Fig. In the figure, the initial state is represented
by a circle with an arrow pointing towards it, the final state by two concentric circles, and the
other states are represented by just a circle. The edges are labelled by input/output (e.g. by 1/0
or 1/1). For example, if the system is in the state qo and the input 1 is applied, the system moves
to state q1 as there is a directed edge from q0 to q1 with label 1/0. It outputs O.

5) Define grammer ?
Constitute Of Grammar :
Grammar is basically composed of two basic elements –
1. Terminal Symbols –
Terminal symbols are those which are the components of the sentences generated using a
grammar and are represented using small case letter like a, b, c etc.
2. Non-Terminal Symbols –
Non-Terminal Symbols are those symbols which take part in the generation of the sentence but
are not the component of the sentence. Non-Terminal Symbols are also called Auxiliary Symbols
and Variables. These symbols are represented using a capital letter like A, B, C, etc.
Formal Definition of Grammar :
Any Grammar can be represented by 4 tuples – <N, T, P, S>

10) What is derivation Tree?


The derivations in a CFG can be represented using trees. Such trees representing derivations are
called derivation trees. We give below a rigorous definition of a derivation tree.
A derivation tree (also called a parse tree) for a CFG G = (VN, ∑ . P, 5) is a tree
satisfying the following conditions:
(i) Every vertex has a label which is a variable or terminal or A.
(ii) (ii) The root has label S.
(iii) (iii) The label of an internal vertex is a variable.
Various Properties of context free languages (CFL)
Context-Free Language (CFL) is a language which is generated by a context-free grammar or
Type 2 grammar(according to Chomsky classification) and gets accepted by a Pushdown
Automata.
Some very much important properties of a context-free language is:

Regularity- context-free languages are Non-Regular PDA language.


Closure properties :
The context-free languages are closed under some specific operation, closed means after doing
that operation on a context-free language the resultant language will also be a context-free
language.Some such operation are:

. Union Operation
. Concatenation
. Kleene closure
. Reversal operation
. Homomorphism
. Inverse Homomorphism
. Substitution
. init or prefix operation
. Quotient with regular language
. Cycle operation

2. Regular Languages

Regular languages are formal languages that regular expressions can describe and can also be
recognized by finite automata. They are used to define sets of strings, such as sequences of
characters or words, that follow specific patterns.
They are important in computer science and theoretical computer science because they form a
foundation for understanding the theory of computation and the design of compilers and other
software tools.

You might also like