An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA
Formal Languages and Automata Theory
2014-11-05 v1
Abstract
We present here the proof for an alternative procedure to convert a Push Down Automata (PDA) into a Context Free Grammar (CFG). The procedure involves intermediate conversion to a single state PDA. In view of the authors, this conversion is conceptually intuitive and can serve as a teaching aid for the relevant topics.
Keywords
Cite
@article{arxiv.1411.0813,
title = {An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA},
author = {Arjun Bhardwaj and N. S. Narayanaswamy},
journal= {arXiv preprint arXiv:1411.0813},
year = {2014}
}