An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA

An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bhardwaj, Arjun, Narayanaswamy, N. S
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Formal Languages and Automata Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.1411.0813