scientific article; zbMATH DE number 6131600

MaRDI QIDQ4904149zbMATH OpenFDO

Authors Margus Veanes, Nikolaj Bjørner

Publication date 28 January 2013

zbMATH Keywords

finite state transducersregular transducerssymbolic tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Symbolic tree transducers
• Equivalence of symbolic tree transducers
• Forward and backward application of symbolic tree transducers
• scientific article; zbMATH DE number 3858450
• STACS 2004
• scientific article; zbMATH DE number 4108162
• scientific article; zbMATH DE number 1354999
• scientific article; zbMATH DE number 3945364
• Deterministic bottom-up tree transducers and ground term rewrite systems
• Symbolic finite state transducers: algorithms and applications

Cited in

(10)

• Forward and backward application of symbolic tree transducers
• Equivalence of finite-valued symbolic finite transducers
• Symbolic finite state transducers: algorithms and applications
• Linking theorems for tree transducers
• Symbolic tree automata
• scientific article; zbMATH DE number 5529981 (Why is no real title available?)
• Completeness in approximate transduction
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
• Symbolic tree transducers

Describes a project that uses

Uses Software

• Qex
• MONA

This page was built for publication:

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