Recognizable formal power series on trees
- 31 May 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 18 (2) , 115-148
- https://doi.org/10.1016/0304-3975(82)90019-6
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Un théorème de factorisation des produits d'endomorphismes de KnJournal of Algebra, 1980
- Pumping lemmas for term languagesJournal of Computer and System Sciences, 1978
- Representation of a word function as the sum of two functionsTheory of Computing Systems, 1977
- Une demonstration combinatoire de la formule de lagrange a deux variablesDiscrete Mathematics, 1975
- Integral sequential word functions and growth equivalence of lindenmayer systemsInformation and Control, 1973
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- Tree generating regular systemsInformation and Control, 1969
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theoryJournal of Computer and System Sciences, 1967
- On the definition of a family of automataInformation and Control, 1961