Aperiodic string transducers

DOI10.1142/S0129054118420054zbMATH Open1408.68090OpenAlexW2888617446MaRDI QIDQ4683232FDOQ4683232

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

Recommendations

• Aperiodic string transducers
• FO-definable transformations of infinite strings
• First-order definable string transformations
• Regular transducer expressions for regular transformations
• Regular transformations of infinite strings

zbMATH Keywords

aperiodic monoidtwo-way automatonstreaming string transducerfirst-order transduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• On finite monoids having only trivial subgroups
• Title not available (Why is that?)
• Expressiveness of streaming string transducers
• MSO definable string transductions and two-way finite-state transducers
• Uniformisation of Two-Way Transducers
• Title not available (Why is that?)
• First-order definable string transformations
• Regular Transformations of Infinite Strings
• Title not available (Why is that?)
• From Two-Way to One-Way Finite State Transducers
• Logic-Automata Connections for Transformations
• From Monadic Second-Order Definable String Transformations to Transducers
• First-order definability of rational transductions

Cited In (2)

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

This page was built for publication: Aperiodic string transducers

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