The rank of a formal tree power series

DOI10.1016/0304-3975(83)90100-7MaRDI QIDQ792763zbMATHOpenAlexFDO

Authors 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 rankformal power series on treesHankel-like characterization of recognizable series

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Free nonassociative algebras (17A50)

Recommendations

• Some remarks on recognizable treeseries
• Finitely presentable tree series
• Représentations matricielles des séries d'arbre reconnaissables
• scientific article; zbMATH DE number 708666
• Varieties of recognizable tree series over fields

Cites work

• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• Matrices de Hankel
• Recognizable formal power series on trees

Cited in

(29)

• Minimizing deterministic weighted tree automata
• scientific article; zbMATH DE number 708666 (Why is no real title available?)
• Varieties of recognizable tree series over fields
• Kleene theorem in partial Conway theories with applications
• Rational transformations and a Kleene theorem for power series over rational monoids
• Effective construction of the syntactic algebra of a recognizable series on trees
• scientific article; zbMATH DE number 4121414 (Why is no real title available?)
• -Treeautomata and their relation to weighted context-free grammars
• Lower bounds for arithmetic circuits via the Hankel matrix
• scientific article; zbMATH DE number 2040322 (Why is no real title available?)
• Survey: Weighted extended top-down tree transducers. III. Composition
• PURE AND O-SUBSTITUTION
• Représentations matricielles des séries d'arbre reconnaissables
• Formal series over sorted algebras
• scientific article; zbMATH DE number 2040320 (Why is no real title available?)
• Minimizing Deterministic Weighted Tree Automata
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Varieties of formal series on trees and Eilenberg's theorem
• On the syntactic complexity of tree series
• Ambiguity Hierarchies for Weighted Tree Automata
• Recognizable formal series on trees and cofree coalgebraic systems
• Finitely presentable tree series
• Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series)
• Definable transductions and weighted logics for texts
• Ranking and formal power series
• Approximate minimization of weighted tree automata
• Actions, finite state sets and applications to trees
• Tree-Series-to-Tree-Series Transformations
• Ambiguity hierarchies for weighted tree automata

This page was built for publication: The rank of a formal tree power series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792763)