Abstract
In this paper we consider the extension of Nerode theorem to infinite trees. Unfortunately, we prove that this extension is not possible. We give some characterisations of Recognizable and Rational ω-tree sets in terms of ω-tree automata. We consider some complexity measures of Recognizable and Rational ω-tree sets and prove that these measures define infinite hierarchies.
Author supplied keywords
Cite
CITATION STYLE
Saoudi, A., Muller, D. E., & Schupp, P. E. (1990). Recognizable infinite tree sets and their complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 472 LNCS, pp. 91–103). Springer Verlag. https://doi.org/10.1007/3-540-53487-3_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
