Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 24, Number 1, 1990
Page(s) 47 - 66
DOI https://doi.org/10.1051/ita/1990240100471
Published online 01 February 2017
  1. 1. J. BERSTEL, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
  2. 2. J. C. BIRGET, Concatenation of Inputs in a Two-Way Automaton, Theoret. Comp. Sci., Vol. 63, 1989, pp. 141-156. [MR: 984314] [Zbl: 0664.68081] [Google Scholar]
  3. 3. J. C. BIRGET, Machines and expansions of a semigroup, and applications, Ph. D. thesis, U. of California, Berkeley, May 1983. [Google Scholar]
  4. 4. J. C. BIRGET, Arbitrary Versus Regular Semigroups, J. Pure and Appl. Algebra, Vol. 34, 1984, pp. 56-115. [MR: 766155] [Zbl: 0547.20055] [Google Scholar]
  5. 5. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  6. 6. J. E. HOPCROFT, and J. D. ULLMAN, Formal Languages and their Relation to Automata, Addison-Wesley, 1969, and [MR: 237243] [Zbl: 0196.01701] [Google Scholar]
  7. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  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. [EuDML: 92224] [MR: 795773] [Zbl: 0604.68094] [Google Scholar]
  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. [MR: 103796] [Zbl: 0158.25601] [Google Scholar]
  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. [MR: 785156] [Zbl: 0496.68052] [Google Scholar]
  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. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.