2000 character limit reached
An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA (1411.0813v1)
Published 4 Nov 2014 in cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.