PURE AND O-SUBSTITUTION

DOI10.1142/S0129054107005005MaRDI QIDQ3503097zbMATH OpenFDO

Authors Andreas Maletti

Publication date 20 May 2008

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

Full work available at URL https://doi.org/10.1142/S0129054107005005

zbMATH Keywords

distributivitypreservation of recognizabilityTree series substitutiontree series transducerweighted tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Does o-Substitution Preserve Recognizability?
• Tree series transformations that respect copying
• scientific article; zbMATH DE number 1354999
• Some remarks on recognizable treeseries
• The rank of a formal tree power series

Cites work

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

Cited in

(4)

• Tree-Series-to-Tree-Series Transformations
• SEMIGROUPS OF TREE LANGUAGES
• Does o-Substitution Preserve Recognizability?
• Weighted automata and multi-valued logics over arbitrary bounded lattices

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

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