PURE AND O-SUBSTITUTION

DOI10.1142/S0129054107005005zbMath1142.68425MaRDI QIDQ3503097

Andreas Maletti

Publication date: 20 May 2008

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

zbMATH Keywords

distributivityweighted tree automatonpreservation of recognizabilityTree series substitutiontree series transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Tree-Series-to-Tree-Series Transformations ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices

Cites Work

• Compositions of tree series transformations
• Recognizable formal power series on trees
• Equational elements in additive algebras
• Tree series transformations that respect copying
• Generalized sequential machine maps
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Mappings and grammars on trees

This page was built for publication: PURE AND O-SUBSTITUTION