Aperiodic String Transducers

DOI10.1142/S0129054118420054zbMath1408.68090OpenAlexW2888617446MaRDI QIDQ4683232

Luc Dartois, Pierre-Alain Reynier, Ismaël Jecker

Publication date: 20 September 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118420054

zbMATH Keywords

aperiodic monoidtwo-way automatonstreaming string transducerfirst-order transduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

One-way resynchronizability of word transducers ⋮ Register Transducers Are Marble Transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressiveness of Streaming String Transducers
• Logic-Automata Connections for Transformations
• First-order definable string transformations
• Regular Transformations of Infinite Strings
• MSO definable string transductions and two-way finite-state transducers
• First-order definability of rational transductions
• Uniformisation of Two-Way Transducers
• From Monadic Second-Order Definable String Transformations to Transducers
• From Two-Way to One-Way Finite State Transducers
• On finite monoids having only trivial subgroups

This page was built for publication: Aperiodic String Transducers