On the Regular Structure of Prefix Rewriting


We consider a pushdown automaton as a word-rewriting system with labelled rules applied only in a prefix way. The notion of pushdown transition graph is then extended to the notion of prefix transition graph generated by a word-rewriting system and accessible from a given axiom. Such accessible prefix transition graphs are context-free graphs in the sense… (More)
DOI: 10.1016/0304-3975(92)90278-N


3 Figures and Tables

Cite this paper

@article{Caucal1990OnTR, title={On the Regular Structure of Prefix Rewriting}, author={Didier Caucal}, journal={Theor. Comput. Sci.}, year={1990}, volume={106}, pages={61-86} }