A note on sweeping automata

Berman, Piotr

doi:10.1007/3-540-10003-2_62

Piotr Berman¹

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

Included in the following conference series:

International Colloquium on Automata, Languages, and Programming

143 Accesses
14 Citations

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.

References

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
Sakoda W.J. and M. Sipser, Nondeterminism and the size of two-way finite automata, Tenth Annual STOC, 1978.
Google Scholar
Sipser M., Lower Bounds on the size of sweeping automata, Eleventh Annual ACM Symposium on Theory of Computing, May 1979.
Google Scholar

Download references

Author information

Authors and Affiliations

Mathematical Institute of PAS, Nowowiejska 10/50, 00 653, Warszawa, Poland
Piotr Berman

Authors

Piotr Berman
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Berman, P. (1980). A note on sweeping automata. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_62

Download citation

DOI: https://doi.org/10.1007/3-540-10003-2_62
Published: 24 May 2005
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics