×

Lower bounds on the size of sweeping automata. (English) Zbl 0445.68064


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Meyer, A. R.; Fischer, M. J., Economy of description by automata, grammars, and formal systems, (Proceedings, Twelfth Annual SWAT (1971)), 188-191
[2] Schmidt, E. M., Succinctness of Description of Context Free, Regular and Finite Languages, (Ph.D. Thesis (1978), Cornell University)
[3] Sakoda, W. J.; Sipser, M., Nondeterminism and the size of two-way finite automata, (Proceedings, Tenth Annual STOC (1978)), 275-286 · Zbl 1282.68160
[4] Berman, P.; Lincas, A., On the Complexity of Regular Languages in Terms of Finite Automata, (Report 304 (1977), Polish Academy of Sciences)
[5] Cook, S. A., The complexity of theorem proving procedures, (Proceedings, Third Annual STOC (1971)), 151-158 · Zbl 0363.68125
[6] Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972), Plenum: Plenum New York), 85-104 · Zbl 0366.68041
[7] Savitch, W. J., Relationship between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 4, 177-192 (1970) · Zbl 0188.33502
[8] J. Seiferas, personal communication.; J. Seiferas, personal communication.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.