Sequences of words defined by two-way transducers

DOI10.1016/j.tcs.2016.05.004zbMath1429.68201OpenAlexW2395849158MaRDI QIDQ728270

Christian Choffrut

Publication date: 19 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.004

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (2)

Input- or output-unary sweeping transducers are weaker than their 2-way counterparts ⋮ Finite transducers and rational transductions

Cites Work

• A note on Sturmian words
• Characteristic Sturmian words are extremal for the critical factorization theorem
• The Shuffle Product: New Research Directions
• A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
• On the product of balanced sequences
• Hopcroft's algorithm and tree-like automata
• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
• MSO definable string transductions and two-way finite-state transducers
• Uniformisation of Two-Way Transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequences of words defined by two-way transducers