PUSH DOWN AUTOMATA

 It is a finite automata with extra memory called stack which helps PDA to recognize CFG.
 A PDA is more powerfull than FA
 Any language which is acceptable by FA can also be acceptable by PDA.

decidable properties of cfg
ChatGPT
ChatGPT
Decidability in the context of Context-Free Grammars (CFGs) refers to the question of whether certain problems related to CFGs can be algorithmically solved. Here are some decidability properties of
Context-Free Grammars:

1. Membership Problem:
 Problem: Given a CFG G and a string w, is w in the language generated by G?
 Decidability: The membership problem for CFGs is decidable. Algorithms like CYK (Cocke-Younger-Kasami) can determine whether a given string is generated by a CFG.
2. Equivalence Problem:
 Problem: Given two CFGs, G1 and G2, do they generate the same language?
 Decidability: The equivalence problem for CFGs is decidable. Algorithms exist to check whether two CFGs generate the same language.
3. Emptiness Problem:
 Problem: Is the language generated by a given CFG empty?
 Decidability: The emptiness problem for CFGs is decidable. Algorithms can determine whether a CFG generates any strings or not.
4. Ambiguity Problem:
 Problem: Is a given CFG ambiguous?
 Decidability: The ambiguity problem for CFGs is undecidable. There is no general algorithm that can determine whether a CFG is ambiguous.
5. Finiteness Problem:
 Problem: Does a given CFG generate only a finite language?
 Decidability: The finiteness problem for CFGs is decidable. Algorithms can determine whether a CFG generates a finite language.
6. Regularity Problem:
 Problem: Is the language generated by a given CFG regular?
 Decidability: The regularity problem for CFGs is undecidable. There is no algorithm that can decide whether a CFG generates a regular language.
7. Reachability Problem:
 Problem: Given a CFG G and two non-terminals A and B, is it possible to derive a string with A yielding B?
 Decidability: The reachability problem for CFGs is decidable. Algorithms can determine whether it is possible to derive a string from one non-terminal to another.