From Two-Way to One-Way Finite State Transducers

DOI10.1109/LICS.2013.53zbMath1366.68143arXiv1301.5197MaRDI QIDQ5271084

Pierre-Alain Reynier, Olivier Gauwin, Frédéric Servais, Emmanuel Filiot

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://arxiv.org/abs/1301.5197

Mathematics Subject Classification ID

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

Related Items (12)

On the decidability of the valuedness problem for two-way finite transducers ⋮ Weighted two-way transducers ⋮ Deciding whether an attributed translation can be realized by a top-down transducer ⋮ Input- or output-unary sweeping transducers are weaker than their 2-way counterparts ⋮ Aperiodic String Transducers ⋮ One-way resynchronizability of word transducers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Aperiodic String Transducers ⋮ From Nondeterministic to Multi-Head Deterministic Finite-State Transducers ⋮ Unnamed Item ⋮ From Two-Way Transducers to Regular Function Expressions

This page was built for publication: From Two-Way to One-Way Finite State Transducers