article

Free access

Alternation

Authors:

Ashok K. Chandra,

Dexter C. Kozen, and

Larry J. StockmeyerAuthors Info & Claims

Journal of the ACM (JACM), Volume 28, Issue 1

Pages 114 - 133

https://doi.org/10.1145/322234.322243

Published: 01 January 1981 Publication History

PDF eReader

References

[1]

AHO, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

Crossref

Google Scholar

[2]

HERMAN, L. Precise bounds for Presburger arithmetic and the reals with addition. Proc. 18th IEEE Symp. on Foundations of Computer Science, Providence, R.I., 1977, pp. 95-99.

Google Scholar

[3]

BORODIN, A. Personal communication.

Google Scholar

[4]

CHANDRA, A.K., AND STOCKMEYER, L.J. Alternation. Proc. 17th 1EEE Symp. on Foundations of Computer Science, Houston, Texas, 1976, pp. 98-108.

Google Scholar

[5]

COOK, S.A. The complexity of theorem proving procedures. Proc. 3rd ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971, pp. 151-158.

Crossref

Google Scholar

[6]

FISCHER, M.J., AND LADNER, R.E. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 2 (1979), 194-211.

Google Scholar

[7]

GOLDSCHLAGER, L.M. A unified approach to models of synchronous parallel machines. Proc. 10th ACM Symp. on Theory of Computing, San Diego, Calif. 1978, pp. 89-94.

Crossref

Google Scholar

[8]

HARTMANIS, J., AND HUNT, H.B. III. The LBA problem and its importance in the theory of computing. In Complexity of Computation, R.M. Karp, Ed., American Mathematical Society, Providence, R.I., 1974, pp. 1-26.

Google Scholar

[9]

HARTMANIS, J., AND SIMON, J. On the power of multiplication in random access machines. Proc. 15th IEEE Symp. on Switching and Automata Theory, New Orleans, La., 1974, pp. 13-23.

Google Scholar

[10]

HOPCROFT, J.E., AND ULLMAN, J.D. Formal Languages and their Relation to Automata. Addison- Wesley, Reading, Mass., 1969.

Crossref

Google Scholar

[11]

KARP, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-104.

Google Scholar

[12]

KASA'I, T., ADACHI, A., AND 1WATA, S. Classes of pebble games and complete problems. SIAM J. Comput. 8 (1979), 574-586.

Google Scholar

[13]

KOZEN, D. On parallelism in Turing machines. Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston, Texas, 1976, pp. 89-97.

Google Scholar

[14]

KOZEN, D. Complexity of Boolean algebras. Theoret. Comput. ScL I0 (1980), 221-247.

Google Scholar

[15]

LADNER, R.E., LIPTON, R.J., AND STOCKMEYER, L.J. Alternating pushdown automata. Proc. 19th 1EEE Symp. on Foundations of Computer Science, Ann Arbor, Mich., 1978.

Google Scholar

[16]

MEYER, A.R., AND FISCHER, M.J. Economy of description of automata, grammars, and formal systems. Proc. 12th IEEE Symp. on Switching and Automata Theory, East Lansing, Mich., 1971, pp. 188-191.

Google Scholar

[17]

PRATT, V.R., AND STOCKMEYER, L.J. A characterization of the power of vector machines. J. Comput. Syst. ScL 12 (1976), 198-221.

Google Scholar

[18]

RABIN, M.O., AND SCOTT, D. Finite automata and their decision problems. IBM J. Res. Dev. 3 (1959), 115-125.

Google Scholar

[19]

Rozzo, W.L. General context-free language recognition. Ph.D. Diss., Computer Science Division, Univ. of California, Berkeley, Calif., 1978.

Crossref

Google Scholar

[20]

SAVITCH, W.J. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci 4 (1970), 177-192.

Google Scholar

[21]

SAVITCH, W.J., AND STIMSON, M.J. The complexity of time bounded recursive computations. Proc. 1976 Johns Hopkins Conf. on Information Sciences and Systems, Baltimore, Md., pp. 42-46.

Google Scholar

[22]

SCOTT, D. Outline of a mathematical theory of computation. Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems, Princeton, N. J. 1970, pp. 169-176.

Google Scholar

[23]

SIMON, J. On feasible numbers. Proc. 9th ACM Symp. on Theory of Computing, Boulder, Colo., 1977, pp. 195-207.

Crossref

Google Scholar

[24]

STOCKMEYER, L.J. The polynomial-time hierarchy. Theoret. Comput. ScL 3 (1977), 1-22.

Google Scholar

[25]

STOCKMEYER, L.J., AND CHANDRA, A.K. Provably difficult combinatorial games. SIAM J. Comput. 8 (1979), 151-174.

Google Scholar

[26]

STOCKMEYER, L.J., AND MEYER, A.R. Word problems requiring exponentialtime: Preliminary report. Proc. 5th ACM Symp. on Theory of Computing, Austin, Texas, 1973, pp. 1-9.

Crossref

Google Scholar

[27]

WRATHALL, C. Complete sets and the polynomial-time hierarchy. Theoret. Comput. ScL 3 (1977), 23-34.

Google Scholar

Cited By

View all

Esparza JRubio RSickert S(2024)Efficient Normalization of Linear Temporal LogicJournal of the ACM10.1145/365115271:2(1-42)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3651152
Kupferman OShenwald N(2024)The Complexity of LTL Rational SynthesisACM Transactions on Computational Logic10.1145/364847325:2(1-31)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1145/3648473
Zakzok MSalomaa K(2024)Converting finite width AFAs to nondeterministic and universal finite automataTheoretical Computer Science10.1016/j.tcs.2024.114506996:COnline publication date: 21-May-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114506
Show More Cited By

Index Terms

Alternation
1. Theory of computation
  1. Models of computation
    1. Computability
      1. Turing machines

Recommendations

From bidirectionality to alternation

We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on finite words, and extend it to automata on infinite words.

Read More
Alternation
SFCS '76: Proceedings of the 17th Annual Symposium on Foundations of Computer Science

We define alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate. Alternation links up time and space complexities rather well, in that alternating polynomial time equals ...
Read More
Alternation for sublogarithmic space-bounded alternating pushdown automata

This paper investigates infinite hierarchies on alternation-depth and alternation-size of alternating pushdown automata (apda's) with sublogarithmic space. We first show that there is an infinite hierarchy on alternation-depth for apda's with ...
Read More

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 28, Issue 1

Jan. 1981

190 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322234

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in JACM Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,359
Total Citations
View Citations
5,854
Total Downloads

Downloads (Last 12 months)865
Downloads (Last 6 weeks)90

Other Metrics

View Author Metrics

Citations

Cited By

View all

Esparza JRubio RSickert S(2024)Efficient Normalization of Linear Temporal LogicJournal of the ACM10.1145/365115271:2(1-42)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3651152
Kupferman OShenwald N(2024)The Complexity of LTL Rational SynthesisACM Transactions on Computational Logic10.1145/364847325:2(1-31)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1145/3648473
Zakzok MSalomaa K(2024)Converting finite width AFAs to nondeterministic and universal finite automataTheoretical Computer Science10.1016/j.tcs.2024.114506996:COnline publication date: 21-May-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114506
Mitrana VPăun APăun MCouso J(2024)Jump complexity of finite automata with translucent lettersTheoretical Computer Science10.1016/j.tcs.2024.114450992(114450)Online publication date: Apr-2024
https://doi.org/10.1016/j.tcs.2024.114450
Bruse FLange M(2024)Model checking timed recursive CTLInformation and Computation10.1016/j.ic.2024.105168298(105168)Online publication date: Jun-2024
https://doi.org/10.1016/j.ic.2024.105168
Skapinakis E(2024)Recursion-Theoretic AlternationTwenty Years of Theoretical and Practical Synergies10.1007/978-3-031-64309-5_20(252-264)Online publication date: 2-Jul-2024
https://doi.org/10.1007/978-3-031-64309-5_20
Das ADe A(2024)A Proof Theory of ($$\omega $$-)Context-Free Languages, via Non-wellfounded ProofsAutomated Reasoning10.1007/978-3-031-63501-4_13(237-256)Online publication date: 2-Jul-2024
https://doi.org/10.1007/978-3-031-63501-4_13
Austin PBose STotzke P(2024)Parity Games on Temporal GraphsFoundations of Software Science and Computation Structures10.1007/978-3-031-57228-9_5(79-98)Online publication date: 5-Apr-2024
https://doi.org/10.1007/978-3-031-57228-9_5
Roush F(2024)An Algebraic-Geometric Approach to NP Problems IIAdvances in Information and Communication10.1007/978-3-031-54053-0_13(171-181)Online publication date: 17-Mar-2024
https://doi.org/10.1007/978-3-031-54053-0_13
Spengler SSil S(2023)TSO Games - On the decidability of safety games under the total store order semanticsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.390.6390(82-98)Online publication date: 30-Sep-2023
https://doi.org/10.4204/EPTCS.390.6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

From bidirectionality to alternation

Alternation

Alternation for sublogarithmic space-bounded alternating pushdown automata

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations