Context-free series on trees
From MaRDI portal
Publication:1854452
DOI10.1006/inco.2001.2890zbMath1007.68086OpenAlexW2027769073MaRDI QIDQ1854452
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5a8dd25cae12d62e9625443060fe52bdc383360f
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42) Semirings (16Y60)
Related Items (11)
Compositions of tree series transformations ⋮ Nonassociativity à la Kleene ⋮ Colored operads, series on colored operads, and combinatorial generating systems ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ Tree-Series-to-Tree-Series Transformations ⋮ RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Algebraic Systems and Pushdown Automata ⋮ Hierarchies of tree series transformations ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizable formal power series on trees
- Alphabetic tree relations
- Un théorème de duplication pour les forets algébriques
- Equational elements in additive algebras
- On Lindenmayerian algebraic power series
- Simple program schemes and formal languages
- Représentations matricielles des séries d'arbre reconnaissables
- Formal computations of non deterministic recursive program schemes
- Bottom-up and top-down tree transformations— a comparison
- Forêts Algébriques et Homomorphismes Inverses
- Floyd-Hoare logic in iteration theories
- Two Families of Languages Related to ALGOL
This page was built for publication: Context-free series on trees
