Journal of the ACM Bibliography

Selected papers that cite this one

• Noa Globerman and David Harel. Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science, 169(2):161-184, 5 December 1996.

• Tirza Hirst and David Harel. On the power of bounded concurrency II: Pushdown automata. Journal of the ACM, 41(3):540-554, May 1994.

Selected references

• Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.

• Ashok K. Chandra and Larry J. Stockmeyer. Alternation. In 17th Annual Symposium on Foundations of Computer Science, pages 98-108, Houston, Texas, 25-27 October 1976. IEEE.

• David Harel, Roni Rosner, and Moshe Vardi. On the power of bounded concurrency III: Reasoning about programs (preliminary report). In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 478-488, Philadelphia, Pennsylvania, 4-7 June 1990. IEEE Computer Society Press.

• Tirza Hirst and David Harel. On the power of bounded concurrency II: Pushdown automata. Journal of the ACM, 41(3):540-554, May 1994.

• Dexter Kozen. On parallelism in Turing machines. In 17th Annual Symposium on Foundations of Computer Science, pages 89-97, Houston, Texas, 25-27 October 1976. IEEE.

• Dexter Kozen. Lower bounds for natural proof systems. In 18th Annual Symposium on Foundations of Computer Science, pages 254-266, Providence, Rhode Island, 31 October-2 November 1977. IEEE.

• A. R. Meyer and M. J. Fischer. Economy of description by automata, grammars, and formal systems. In Conference Record 1971 Twelfth Annual Symposium on Switching and Automata Theory, pages 188-191, East Lansing, Michigan, 13-15 October 1971. IEEE.

• Shmuel Safra. On the complexity of omega-automata. In 29th Annual Symposium on Foundations of Computer Science, pages 319-327, White Plains, New York, 24-26 October 1988. IEEE.

• Shmuel Safra. Exponential determinization for omega-automata with strong-fairness acceptance condition (extended abstract). In Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, pages 275-282, Victoria, British Columbia, Canada, 4-6 May 1992.

• Robert S. Streett. Propositional dynamic logic of looping and converse is elementarily decidable. Information and Control, 54(1/2):121-141, July/August 1982.

Shortcuts: