From monadic second-order definable string transformations to transducers

DOI10.1109/LICS.2013.52MaRDI QIDQ5271083zbMATH OpenFDO

Authors Antoine Durand-Gasselin, Ashutosh Trivedi, Rajeev Alur

Publication date 3 July 2017

Published in 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/LICS.2013.52

zbMATH Keywords

\(\omega\)-regular transformationsmonadic second-order logicstreaming string transducerstree transducers

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• MSO definable string transductions and two-way finite-state transducers
• Streaming ranked-tree-to-string transducers
• Regular transformations of infinite strings
• First-order definable string transformations
• FO-definable transformations of infinite strings

Cited in

(7)

• Regular Transformations of Data Words Through Origin Information
• Aperiodic string transducers
• First-order definable string transformations
• Regular transformations of infinite strings
• MSO definable string transductions and two-way finite-state transducers
• Aperiodic string transducers
• Semantical evaluations as monadic second-order compatible structure transformations

This page was built for publication: From monadic second-order definable string transformations to transducers

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