A note on sweeping automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 85 LNCS, Issue , 1980, Pages 91-97

  Berman, Piotr ^a  

^a POLISH ACADEMY OF SCIENCES   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001777419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10003-2_62     Document Type: Conference Paper

References (3)

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