Tree series transformations that respect copying

DOI10.1007/S00224-003-1072-ZMaRDI QIDQ1405790zbMATH OpenOpenAlexFDO

Authors Zoltán Fülöp, Heiko Vogler

Publication date 26 August 2003

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-003-1072-z

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Does o-Substitution Preserve Recognizability?
• scientific article; zbMATH DE number 1809721
• Compositions of tree series transformations
• scientific article; zbMATH DE number 1354999
• Developments in Language Theory

Cited in

(16)

• Compositions of constant weighted extended tree transducers
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Hierarchies of Tree Series Transformations Revisited
• scientific article; zbMATH DE number 1809721 (Why is no real title available?)
• PURE AND O-SUBSTITUTION
• Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
• Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
• Survey: Weighted extended top-down tree transducers. III. Composition
• Hierarchies of tree series transformations
• Compositions with Constant Weighted Extended Tree Transducers
• Incomparability results for classes of polynomial tree series transformations
• Compositions of tree series transformations
• Tree-Series-to-Tree-Series Transformations
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Developments in Language Theory
• Does o-Substitution Preserve Recognizability?

This page was built for publication: Tree series transformations that respect copying

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