Abstract
In a previous paper we showed that two-way (nondeterministic) transducers with unary input and output alphabets have the same recognition power as the sweeping ones. We show that this no longer holds when one of the alphabets has cardinality at least 2.
Subject
Computer Science Applications,General Mathematics,Software
Reference18 articles.
1. J. Alfonsín, The Diophantine Frobenius Problem. Oxford Lecture Series in Mathematics and Its Applications. OUP, Oxford (2005).
2. M. Anselmo, Two-way automata with multiplicity. In Automata, Languages and Programming. Vol. 443 of Lect. Notes Comput. Sci. Springer-Verlag, Berlin/Heidelberg (1990) 88–102.
3. F. Baschenis, O. Gauwin, A. Muscholl and G. Puppis, One-way definability of sweeping transducer. In 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS (2015) 16-18, 2015, Bangalore, India (2015) 178–191.
4. J. Berstel, Transductions and context-free languages. Teubner (1979).
5. V. Carnino and S. Lombardy,Tropical Two-Way Automata. In vol. 8705, Theoretical Computer Science, Berlin, Heidelberg, Springer Berlin Heidelberg (2014) 195–206.