Symbolic tree transducers

DOI10.1007/978-3-642-29709-0_32MaRDI QIDQ3457988zbMATH OpenOpenAlexFDO

Authors Margus Veanes, Nikolaj Bjørner

Publication date 7 December 2015

Published in Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01517919/file/symbeq.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 6131600
• Equivalence of symbolic tree transducers
• Forward and backward application of symbolic tree transducers
• Equivalence of finite-valued symbolic finite transducers
• The power of symbolic automata and transducers

Cited in

(11)

• High level tree transducers and iterated pushdown tree transducers
• Completeness in approximate transduction
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
• Equivalence of finite-valued symbolic finite transducers
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
• scientific article; zbMATH DE number 5529981 (Why is no real title available?)
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
• Symbolic tree automata
• scientific article; zbMATH DE number 6131600 (Why is no real title available?)
• Implementation and Application of Automata
• Alphabetic and synchronized tree transducers

This page was built for publication: Symbolic tree transducers

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