A Nivat Theorem for Quantitative Automata on Unranked Trees

DOI10.1007/978-3-319-63121-9_2zbMath1431.68057OpenAlexW2737533726MaRDI QIDQ5217295

Doreen Götze, Manfred Droste

Publication date: 24 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-63121-9_2

zbMATH Keywords

valuation monoidsweighted tree automataNivat theoremNivat classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Decomposition and factorization of chemical reaction transducers ⋮ A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings

This page was built for publication: A Nivat Theorem for Quantitative Automata on Unranked Trees