Context-Free Tree languages for Descendants

Abstract

The preservation of regular tree languages through rewriting, has already been studied. In this paper, we study the preservation of context-free tree languages through rewriting, for constructor-based term rewrite systems. We give positive and negative results. Positive results are effective since we give algorithms to build context-free grammars. 

Topics

1 Figure or Table

Cite this paper

@inproceedings{Rty2008ContextFreeTL, title={Context-Free Tree languages for Descendants}, author={Pierre R{\'e}ty and Julie Vuotto}, year={2008} }