Two-way automaton computations

Jean-Camille Birget

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1990)

  • Volume: 24, Issue: 1, page 47-66
  • ISSN: 0988-3754

How to cite

top

Birget, Jean-Camille. "Two-way automaton computations." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 24.1 (1990): 47-66. <http://eudml.org/doc/92349>.

@article{Birget1990,
author = {Birget, Jean-Camille},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {two-way automaton},
language = {eng},
number = {1},
pages = {47-66},
publisher = {EDP-Sciences},
title = {Two-way automaton computations},
url = {http://eudml.org/doc/92349},
volume = {24},
year = {1990},
}

TY - JOUR
AU - Birget, Jean-Camille
TI - Two-way automaton computations
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1990
PB - EDP-Sciences
VL - 24
IS - 1
SP - 47
EP - 66
LA - eng
KW - two-way automaton
UR - http://eudml.org/doc/92349
ER -

References

top
  1. 1. J. BERSTEL, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979. Zbl0424.68040MR549481
  2. 2. J. C. BIRGET, Concatenation of Inputs in a Two-Way Automaton, Theoret. Comp. Sci., Vol. 63, 1989, pp. 141-156. Zbl0664.68081MR984314
  3. 3. J. C. BIRGET, Machines and expansions of a semigroup, and applications, Ph. D. thesis, U. of California, Berkeley, May 1983. 
  4. 4. J. C. BIRGET, Arbitrary Versus Regular Semigroups, J. Pure and Appl. Algebra, Vol. 34, 1984, pp. 56-115. Zbl0547.20055MR766155
  5. 5. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, 1974. Zbl0317.94045MR530382
  6. 6. J. E. HOPCROFT, and J. D. ULLMAN, Formal Languages and their Relation to Automata, Addison-Wesley, 1969, and Zbl0196.01701MR237243
  7. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. Zbl0426.68001MR645539
  8. 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. Zbl0604.68094MR795773
  9. 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. Zbl0158.25601MR103796
  10. 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. Zbl0496.68052MR785156
  11. 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. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.