Abstract
A two-way nondeterministic finite automaton is sweeping (snfa) if its input head can change direction only on the end-markers. For every n, we exhibit a language that can be recognized by an n-state snfa but requires \(2^{\varOmega(n)}\) states on every snfa recognizing its complement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Seiferas, J.I.: Manuscript communicated to Michael Sipser (1973)
Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of the Symposium on the Theory of Computing, pp. 275–286 (1978)
Kapoutsis, C.: Deterministic moles cannot solve liveness. In: Proceedings of the Workshop on Descriptional Complexity of Formal Systems, pp. 194–205 (2005)
Sipser, M.: Halting space-bounded computations. Theoretical Computer Science 10, 335–338 (1980)
Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. In: Proceedings of the International Conference on Developments in Language Theory, pp. 260–271 (2005)
Sipser, M.: Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences 21(2), 195–202 (1980)
Berman, P.: A note on sweeping automata. In: Proceedings of the International Colloquium on Automata, Languages, and Programming, pp. 91–97 (1980)
Micali, S.: Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Information Processing Letters 12(2), 103–105 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapoutsis, C.A. (2006). Small Sweeping 2NFAs Are Not Closed Under Complement. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_14
Download citation
DOI: https://doi.org/10.1007/11786986_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)