The Myhill-Nerode Theorem for Recognizable Tree Series
Author:
- 18 June 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 146-158
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Formal Tree SeriesBRICS Report Series, 2002
- The Kleene–Schützenberger Theorem for Formal Power Series in Partially Commuting VariablesInformation and Computation, 1999
- Finite tree automata with cost functionsTheoretical Computer Science, 1994
- Effective construction of the syntactic algebra of a recognizable series on treesActa Informatica, 1991
- Rational Series and Their Languages1988
- Recognizable formal power series on treesTheoretical Computer Science, 1982
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- On the definition of a family of automataInformation and Control, 1961