Abstract
Top-context-free tree languages (called corégulier by Arnold and Dauchet [1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidence for the importance of this class by exhibiting certain closure properties. We systematically treat closure under the operations replacement and substitution as well as under the corresponding iteration operations. Several other well-known language classes are considered as well. Furthermore, various characterizations of the regular top-context-free languages are given, among others by means of restricted regular expressions.
Partially supported by a post-doc grant of the M.E.N.
Supported by the M.E.S.R.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold and M. Dauchet. Transductions de Forêts Reconnaissables Monadiques. Forêts Corégulières. RAIRO Informatique Théorique et applications, 10(3):5–28, 1976.
A. Arnold and M. Dauchet. Un Théorème de Duplication pour les Forêts Algébriques. JCSS, 13:223–244, 1976.
M. Dauchet and S. Tison. Structural Complexity of Classes of Tree Languages. In Tree Automata and Languages, pp. 327–353. Elsevier (North-Holland), 1992.
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In Handbook of Theoretical Computer Science, vol. B, pp. 243–320. Elsevier, 1990.
J. Engelfriet and E. Schmidt. IO and OI. I. JCSS, 15:329–353, 1977.
F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, 1984.
D. Hofbauer and M. Huber. Computing linearizations using test sets. In 3rd International Workshop on Conditional Term Rewriting Systems, LNCS 656, pp. 287–301. Springer-Verlag, 1992.
D. Hofbauer, M. Huber, and G. Kucherov. Some Results on Top-context-free Tree Languages. Centre de Recherche en Informatique de Nancy, Technical Report, to appear, 1993.
J. Hopcroft and J. Ullman. Introduction to Automata Theory. Languages and Computation. Addison-Wesley, 1979.
G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. In 3rd International Workshop on Conditional Term Rewriting Systems, LNCS 656, pp. 272–286. Springer-Verlag, 1992.
G. A. Kucherov. On relationship between term rewriting systems and regular tree languages. In 4th Conference on Rewriting Techniques and Applications, LNCS 488, pp. 299–311. Springer-Verlag, 1991.
T. S. E. Maibaum. Pumping lemmas for term languages. JCSS, 17:319–330, 1978.
K. Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. JCSS, 37:367–394, 1988.
S. Vágvölgyi and R. Gilleron. For a rewriting system it is decidable whether the set of irreducible ground terms is recognizable. Bulletin of the European Association for Theoretical Computer Science, 48:197–209, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hofbauer, D., Huber, M., Kucherov, G. (1994). Some results on top-context-free tree languages. In: Tison, S. (eds) Trees in Algebra and Programming — CAAP'94. CAAP 1994. Lecture Notes in Computer Science, vol 787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017480
Download citation
DOI: https://doi.org/10.1007/BFb0017480
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57879-6
Online ISBN: 978-3-540-48373-1
eBook Packages: Springer Book Archive