Scribd
Upload
30 views1 page

Context Free PDA (Push Down Automata)

1) The document discusses context free pushdown automata (PDA) which can remember an infinite amount of information unlike finite state machines. 2) It explains that genetic programming is used for language induction by searching the entire space of DPDA models to find a generalized solution, as genetic algorithms avoid local minima issues unlike hill climbing. 3) Genetic programs are applicable as they allow for variable chromosome sizes, unlike conventional genetic algorithms which have fixed length chromosomes, and the number of states in the optimal DPDA solution is unknown.

Uploaded by

parmar pratik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views1 page

Context Free PDA (Push Down Automata)

1) The document discusses context free pushdown automata (PDA) which can remember an infinite amount of information unlike finite state machines. 2) It explains that genetic programming is used for language induction by searching the entire space of DPDA models to find a generalized solution, as genetic algorithms avoid local minima issues unlike hill climbing. 3) Genetic programs are applicable as they allow for variable chromosome sizes, unlike conventional genetic algorithms which have fixed length chromosomes, and the number of states in the optimal DPDA solution is unknown.

Uploaded by

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

Enrollment No : 190180107039

Name : Parmar Pratik Rajubhai


Subject : Theory Of computation

Context Free PDA (Push down Automata)


A Pushdown automaton is a way to implement a context – free grammar in a similar. A DFA
can a regular grammar. A DFA can remember A finite amount of information, but a PDA can
remember an infinite amount of information. Bassically a pushdown automaton is “FINITI
State machine ” + “ a Stack ”
Genetic Programming

In language induction, we are essentially searching the entire space of D-PDA’s to find a
generalized solution which has learned a language. Genetic Algorithms are effective search
algorithms which do not fall into local minima, unlike hill climbing (Tomita 1982.)
Conventional genetic algorithms, however, are not directly applicable to the problem at hand
because their chromosomes have a constant length and the number of states in the solution D-
PDA is unknown. Genetic Programs may be viewed as Genetic Algorithms with variable-
sized chromosomes

FIGURE : GP problem solving pipeline


In each generation, a D-PDAis constructed by runningan program from the population. Once
constructed, the D-PDAis asked to evaluate a number of sentences. Theprogram’s fitness depends on
it’s D-PDA’s performance inasmuch as an animal’s DNA fitness depends on theanimal’s survival.

You might also like