Skip to main content
SpringerLink
Log in

Basic techniques for two-way finite automata

  • Mathematical Foundations Of The Theory Of Automata
  • Conference paper
  • First Online:
Formal Properties of Finite Automata and Applications (LITP 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 386))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. C. Birget, "Arbitrary vs. regular semigroups", J. Pure and Appl. Algebra, vol. 34 (1984) 56–115.

    Google Scholar 

  2. J. C. Birget, "Concatenation of inputs in a two-way automaton," Theoret. Computer Sci. (to appear).

    Google Scholar 

  3. J. C. Birget, "Two-way automaton computations", RAIRO Informatique Théorique (to appear).

    Google Scholar 

  4. J. C. Birget, "proof of a conjecture of R.Kannan" (to be submitted for publication).

    Google Scholar 

  5. P. Berman, A. Lingas, "On the complexity of regular languages in terms of finite automata", Report 304, Polish Academy of Sciences (1977).

    Google Scholar 

  6. J. Hopcroft, J. Ullman, "Intro. to Automata Theory, Languages and Computation", Addison-Wesley (1979).

    Google Scholar 

  7. R. Kannan, "Alternation and the power of non-determinism", Proc. 15th ACM Sym. on Theory of Computing (1983) 344–364.

    Google Scholar 

  8. J. P. Pécuchet, "Automates boustrophedon, semigroupe de Birget et monoide inversif libre", RAIRO Informatique Théorique, vol. 19, 1 (1985) 71–100.

    Google Scholar 

  9. M.O. Rabin, "Two-way automata", Proc. Summer Inst. of Symbolic Logic, Cornell Univ. (1957), 366–369.

    Google Scholar 

  10. M.O.Rabin, D.Scott, "Finite automata and their decision problems", IBM J. Res. and Devel. (1959) 115–125 and in E. F. Moore (ed.), "Sequential Machines: Selected Papers", Addison-Wesley (1964).

    Google Scholar 

  11. M. Sipser, "Lower bounds on the size of sweeping machines", Proc. 11th ACM Sym. on Theory of Computing (1979) 360–364.

    Google Scholar 

  12. J. C. Shepherdson, "The reduction of two-way automata to one-way automata", IBM J. Res. and Devel. (1959) 198–200, and in E. F. Moore (ed.), "Sequential Machines: Selected Papers", Addison-Wesley (1964).

    Google Scholar 

  13. W. Sakoda, M. Sipser, "Non-determinism and the size of two-way automata", Proc. 10th ACM Sym. on Theory of Computing (1978) 275–286.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, University of Nebraska, 68588, Lincoln, NE, USA

    Jean-Camille Birget

Authors
  1. Jean-Camille Birget
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Birget, JC. (1989). Basic techniques for two-way finite automata. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013111

Download citation

  • DOI: https://doi.org/10.1007/BFb0013111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51631-6

  • Online ISBN: 978-3-540-46721-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation