Article

Free access

Computations with a restricted number of nondeterministic steps (Extended Abstract)

Authors:

Chandra M. R. Kintala,

Patrick C. FischerAuthors Info & Claims

STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing

Pages 178 - 185

https://doi.org/10.1145/800105.803407

Published: 04 May 1977 Publication History

Abstract

Nondeterminism is one of the most elusive concepts in computing.

In this paper we direct our efforts towards viewing nondeterminism as an additional resource at the disposal of time or space bounded Turing machine computations and study the classes of languages acceptable by these machines with restricted amounts of nondeterminism.

One motivation for this study comes from the observation that for many of the well-known NP-complete problems, if n' is the length of the input, an algorithm exists requiring a total number of moves which is polynomial in n, but the number of nondeterministic moves is only linear in n.

References

[1]

Baker, T., Gill, J. and Solovay, R. (1975): Relativization of the P &equil; ?NP Questions, SIAM J. Computing, V4, N4, pp. 431-442.

[2]

Book, R. (1974): Comparing Complexity Classes, JCSS, V9, pp. 213-229.

[3]

Book, R. and Greibach, S. A. (1970): Quasi-Real Time Languages, Math. Syst. Theory, V4, N2, pp. 97&ndash111.

[4]

Chandra, A. and Stockmeyer, L. (1976): Alternations, Proc. of 17th Symp. on FOCS, 1976, pp. 98-108.

Digital Library

[5]

Cook, S. (1971): The Complexity of Theorem Proving Procedures, Proc. of 3rd STOC, pp. 151-158.

Digital Library

[6]

Greibach, S. (1973): The Hardest Context-Free Language, SIAM J. on Computing, V2, N4, pp. 304-310.

[7]

Hartmanis, J. and Stearns, R. E. (1965): On the Computational Complexity of Algorithms, TAMS, V117, N5, pp. 285&ndash306.

[8]

Karp, R. (1972): Reducibilities among Combinatorial Problems, in Complexity of Computer Computations, Plenum Press, pp. 85-104.

[9]

Kozen, D. (1976): On Parallelism in Turing Machines, Proc. of 17th Symp. on FOCS, 1976, pp. 89-97.

Digital Library

[10]

Meyer, A. and Fischer, M. J. (1971): Economy of Descriptions by Automata, Grammars and Formal Systems, 12th Symp. on SWAT, pp. 188-191.

Digital Library

[11]

Paterson, M. (1972): Tape Bounds for Time-Bounded Turing Machines, JCSS, V6, pp. 116-124.

[12]

Pratt, V. (1975): Every Prime has a Succinct Certificate, SIAM J. on Computing, V4, N3, pp. 214-220.

[13]

Rabin, M. and Scott, D. (1959): Finite Automata and Decision Problems, IBM J. Res., V3, N2, pp. 115-125.

[14]

Rosenberg, A. (1967): Real-Time Definable Languages, JACM, V14, pp. 645-662.

Digital Library

[15]

Ruby, S. and Fischer, P. C. (1965): Translational Methods and Computational Complexity, Proc. of 6th Conf. on SWAT, pp. 73-178.

Digital Library

[16]

Savitch, W. (1970): Relationships between Nondeterministic and Deterministic Tape Complexities, JCSS, V4, pp. 177-192.

[17]

Wotschke, D. (1975): Degree-Languages, Polynomial Time Recognition and the LBA-Problem, Proc. of 7th STOC, pp. 145-152.

Digital Library

Cited By

Williams RMohar BShinkar IO'Donnell R(2024)Self-Improvement for Circuit-Analysis ProblemsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649723(1374-1385)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649723
Kutrib M(2020)Iterative arrays with self-verifying communication cellNatural Computing10.1007/s11047-020-09812-421:1(39-51)Online publication date: 5-Nov-2020
https://doi.org/10.1007/s11047-020-09812-4
Kutrib M(2018)Cellular Automata and Language TheoryCellular Automata10.1007/978-1-4939-8700-9_54(513-542)Online publication date: 28-Nov-2018
https://doi.org/10.1007/978-1-4939-8700-9_54
Show More Cited By

Index Terms

Computations with a restricted number of nondeterministic steps (Extended Abstract)
1. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness
  2. Models of computation
    1. Computability
      1. Turing machines

Recommendations

Nondeterministic fuzzy automata

To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been generalized into fuzzy automata. After a reexamination of the notions of fuzzy automata in the literature, we ascertain that the fundamental property-...
Reversal-bounded computations
Extended Nondeterministic Finite Automata
Hardest Boolean Functions and O.B. Lupanov

We consider a new expansion of nondeterministic finite automata. The goals of this consideration are: to apply some algorithms of such expansion for various problems of minimization of classical nondeterministic automata; to use such automata for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing

May 1977

318 pages

ISBN:9781450374095

DOI:10.1145/800105

Copyright © 1977 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

STOC '77 Paper Acceptance Rate 31 of 87 submissions, 36%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
314
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)6

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Williams RMohar BShinkar IO'Donnell R(2024)Self-Improvement for Circuit-Analysis ProblemsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649723(1374-1385)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649723
Kutrib M(2020)Iterative arrays with self-verifying communication cellNatural Computing10.1007/s11047-020-09812-421:1(39-51)Online publication date: 5-Nov-2020
https://doi.org/10.1007/s11047-020-09812-4
Kutrib M(2018)Cellular Automata and Language TheoryCellular Automata10.1007/978-1-4939-8700-9_54(513-542)Online publication date: 28-Nov-2018
https://doi.org/10.1007/978-1-4939-8700-9_54
Kutrib MMalcher AWendlandt M(2017)Shrinking one-way cellular automataNatural Computing: an international journal10.1007/s11047-016-9588-816:3(383-396)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s11047-016-9588-8
Kutrib M(2015)Complexity of One-Way Cellular AutomataCellular Automata and Discrete Complex Systems10.1007/978-3-319-18812-6_1(3-18)Online publication date: 15-May-2015
https://doi.org/10.1007/978-3-319-18812-6_1
Kutrib M(2012)Non-deterministic cellular automata and languagesInternational Journal of General Systems10.1080/03081079.2012.69589641:6(555-568)Online publication date: Aug-2012
https://doi.org/10.1080/03081079.2012.695896
Kutrib M(2012)Cellular Automata and Language TheoryComputational Complexity10.1007/978-1-4614-1800-9_25(359-381)Online publication date: 2012
https://doi.org/10.1007/978-1-4614-1800-9_25
Williams RMitzenmacher MSchulman L(2010)Improving exhaustive search implies superpolynomial lower boundsProceedings of the forty-second ACM symposium on Theory of computing10.1145/1806689.1806723(231-240)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1806689.1806723
Holzer MKutrib M(2010)Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown AutomataReachability Problems10.1007/978-3-642-15349-5_1(1-23)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15349-5_1
Kutrib MMalcher AWerlein L(2009)Regulated nondeterminism in pushdown automataTheoretical Computer Science10.1016/j.tcs.2009.06.002410:37(3447-3460)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.06.002
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents