The rank of a formal tree power series

DOI10.1016/0304-3975(83)90100-7zbMath0537.68053MaRDI QIDQ792763

Symeon Bozapalidis, Olympia Louscou-Bozapalidou

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

zbMATH Keywords

finite rank; formal power series on trees; Hankel-like characterization of recognizable series

Mathematics Subject Classification ID

68Q70: Algebraic theory of languages and automata

17A50: Free nonassociative algebras

Related Items

Varieties of recognizable tree series over fields, Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series), Definable transductions and weighted logics for texts, Effective construction of the syntactic algebra of a recognizable series on trees, Minimizing deterministic weighted tree automata, Recognizable formal series on trees and cofree coalgebraic systems, Représentations matricielles des séries d'arbre reconnaissables, 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, On the syntactic complexity of tree series, Tree-Series-to-Tree-Series Transformations, -Treeautomata and their relation to weighted context-free grammars, Actions, finite state sets and applications to trees

Cites Work

• Recognizable formal power series on trees
• Matrices de Hankel
• Unnamed Item