A note on sweeping automata

  • Piotr Berman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


Minimal Size Regular Language Finite Automaton Input Word Consecutive Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Berman P. and A. Lingas, On the complexity of regular languages in terms of finite automata, ICS PAS Report no 304, 1977, Warszawa.Google Scholar
  2. [2]
    Sakoda W.J. and M. Sipser, Nondeterminism and the size of two-way finite automata, Tenth Annual STOC, 1978.Google Scholar
  3. [3]
    Sipser M., Lower Bounds on the size of sweeping automata, Eleventh Annual ACM Symposium on Theory of Computing, May 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Piotr Berman
    • 1
  1. 1.Mathematical Institute of PASWarszawaPoland

Personalised recommendations