Some remarks on recognizable treeseries

DOI10.1080/00207169908804780MaRDI QIDQ4240621zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The rank of a formal tree power series
• Varieties of recognizable tree series over fields
• scientific article; zbMATH DE number 708666
• Représentations matricielles des séries d'arbre reconnaissables

Cites work

• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• Effective construction of the syntactic algebra of a recognizable series on trees
• On some questions of rationality and decidability
• On the definition of a family of automata
• Recognizable formal power series on trees

Cited in

(12)

• Varieties of recognizable tree series over fields
• Weighted tree automata and weighted logics
• The rank of a formal tree power series
• PURE AND O-SUBSTITUTION
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• A Medvedev characterization of recognizable tree series
• Finitely presentable tree series
• scientific article; zbMATH DE number 4213466 (Why is no real title available?)
• Definable transductions and weighted logics for texts
• scientific article; zbMATH DE number 5854945 (Why is no real title available?)
• A note on cut-worthiness of recognizable tree series
• Cut sets as recognizable tree languages

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

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