The rank of a formal tree power series
From MaRDI portal
Publication:792763
DOI10.1016/0304-3975(83)90100-7zbMath0537.68053OpenAlexW1973940327MaRDI QIDQ792763
Olympia Louscou-Bozapalidou, Symeon Bozapalidis
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90100-7
Related Items (21)
Definable transductions and weighted logics for texts ⋮ Actions, finite state sets and applications to trees ⋮ Minimisation of Multiplicity Tree Automata ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Varieties of recognizable tree series over fields ⋮ Effective construction of the syntactic algebra of a recognizable series on trees ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ -Treeautomata and their relation to weighted context-free grammars ⋮ On the syntactic complexity of tree series ⋮ Représentations matricielles des séries d'arbre reconnaissables ⋮ Tree-Series-to-Tree-Series Transformations ⋮ Lower bounds for arithmetic circuits via the Hankel matrix ⋮ Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series) ⋮ Approximate minimization of weighted tree automata ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Kleene Theorem in Partial Conway Theories with Applications ⋮ Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition ⋮ Minimizing deterministic weighted tree automata ⋮ Recognizable formal series on trees and cofree coalgebraic systems ⋮ Ambiguity hierarchies for weighted tree automata
Cites Work
This page was built for publication: The rank of a formal tree power series
