Uniformisation of Two-Way Transducers

DOI10.1007/978-3-642-37064-9_48zbMath1377.68123OpenAlexW189876609MaRDI QIDQ4910492

Rodrigo de Souza

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_48

zbMATH Keywords

uniformisationtwo-way transducerdeterminisation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

On the decidability of the valuedness problem for two-way finite transducers ⋮ Input- or output-unary sweeping transducers are weaker than their 2-way counterparts ⋮ Aperiodic String Transducers ⋮ Sequences of words defined by two-way transducers ⋮ Aperiodic String Transducers ⋮ Unnamed Item ⋮ Finite transducers and rational transductions

This page was built for publication: Uniformisation of Two-Way Transducers