Some remarks on recognizable treeseries

DOI10.1080/00207169908804780zbMath0936.68068OpenAlexW2155617474MaRDI QIDQ4240621

Olympia Louscou-Bozapalidou

Publication date: 18 May 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804780

zbMATH Keywords

rational wordseries

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Definable transductions and weighted logics for texts ⋮ Weighted tree automata and weighted logics

Cites Work

• Unnamed Item
• Effective construction of the syntactic algebra of a recognizable series on trees
• Recognizable formal power series on trees
• On some questions of rationality and decidability
• On the definition of a family of automata

This page was built for publication: Some remarks on recognizable treeseries