Regular Transformations of Data Words Through Origin Information

DOI10.1007/978-3-662-49630-5_17zbMath1475.68151OpenAlexW2465734435MaRDI QIDQ2811346

Antoine Durand-Gasselin, Peter Habermehl

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49630-5_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Unnamed Item ⋮ On computability of data word functions defined by transducers ⋮ Synthesis of Data Word Transducers ⋮ Origin-equivalence of two-way word transducers is in PSPACE

Cites Work

• Unnamed Item
• Unnamed Item
• Monadic second-order definable graph transductions: a survey
• Expressiveness of Streaming String Transducers
• Regular Transformations of Infinite Strings
• Streaming Tree Transducers
• MSO definable string transductions and two-way finite-state transducers
• Transducers with Origin Information
• From Monadic Second-Order Definable String Transformations to Transducers
• Streaming transducers for algorithmic verification of single-pass list-processing programs

This page was built for publication: Regular Transformations of Data Words Through Origin Information