no. 1
Two-way automaton computations
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 1, pp. 47-66. 
@article{ITA_1990__24_1_47_0,
     author = {Birget, Jean-Camille},
     title = {Two-way automaton computations},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {47--66},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {1},
     year = {1990},
     mrnumber = {1060466},
     zbl = {0701.68058},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1990__24_1_47_0/}
}
TY  - JOUR
AU  - Birget, Jean-Camille
TI  - Two-way automaton computations
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1990
SP  - 47
EP  - 66
VL  - 24
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1990__24_1_47_0/
LA  - en
ID  - ITA_1990__24_1_47_0
ER  - 
%0 Journal Article
%A Birget, Jean-Camille
%T Two-way automaton computations
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 47-66
%V 24
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1990__24_1_47_0/
%G en
%F ITA_1990__24_1_47_0
Birget, Jean-Camille. Two-way automaton computations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 1, pp. 47-66. http://archive.numdam.org/item/ITA_1990__24_1_47_0/

1. J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979. | MR | Zbl

2. J. C. Birget, Concatenation of Inputs in a Two-Way Automaton, Theoret. Comp. Sci., Vol. 63, 1989, pp. 141-156. | MR | Zbl

3. J. C. Birget, Machines and expansions of a semigroup, and applications, Ph. D. thesis, U. of California, Berkeley, May 1983.

4. J. C. Birget, Arbitrary Versus Regular Semigroups, J. Pure and Appl. Algebra, Vol. 34, 1984, pp. 56-115. | MR | Zbl

5. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, 1974. | MR | Zbl

6. J. E. Hopcroft, and J. D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, 1969, and | MR | Zbl

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. | MR | Zbl

7. J. P. Pécuchet, Automates boustrophedon, semigroupe de Birget et monoïde inversif libre, R.A.I.R.O. (Revue française d'automatique, d'informatique et de rech. opérat.), Informatique théorique, Vol. 19.1, 1985, pp. 71-100. | Numdam | MR | Zbl

8. J. C. Shepherdson, The Reduction of Two-Way to One-Way Automata, I.B.M. J. Res. and Dev., Vol. 3.2, 1959, pp. 198-200, and in E. F. MOORE (Ed.), Sequential Machines: Selected Papers, Addison-Wesley, 1964. | MR | Zbl

9. J. E. Pin and J. Sakarovitch, Some Operations and Transductions which Preserve Rationality, 6th G.I. ( = Gesellschaft für Informatik) Conference, Lecture Notes in Comp. Sci. (Springer Verlag) 145, pp. 277-288 and: Une application de la représentation matricielle des transductions, Theoretical Computer Science, 35, 1985, pp. 271-293. | MR | Zbl

10. J. C. Birget, Proof of a Conjecture of R. Kannan, Proc. 21st A.C.M. Symp. on Theory of Computing, 1989, pp. 445-453.