Both Ways Rational Functions
We consider binary relations on words which can be recognized by finite two-tape devices in two different ways: the traditional way where the two tapes are scanned in the same direction and a new one where they are scanned in different directions. The devices of the former type define the family of rational relations, while those of the latter define an a priori really different family. We characterize the partial functions that are in the intersection of the two families. We state a conjecture for the intersection for general, nonfunctional, relations.
KeywordsRational relations Finite automata Two-way transducers Two-tape automata Word relations
- 2.Choffrut, C., Guillon, B.: An algebraic characterization of unary two-way transducers. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 196–207. Springer, Heidelberg (2014)Google Scholar
- 7.Guillon, B.: Sweeping weakens two-way transducers even with a unary output alphabet. In: Proceedings of Seventh Workshop on NCMA 2015, Porto, Portugal, August 31 – September 1, 2015, pp. 91–108 (2015)Google Scholar
- 10.Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1–3 May 1978, San Diego, California, USA, pp. 275–286 (1978)Google Scholar
- 11.Sipser, M.: Lower bounds on the size of sweeping automata. In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing, April 30 – May 2, 1979, Atlanta, Georgia, USA, pp. 360–364 (1979)Google Scholar