Selected papers that cite this one
- Doron Drusinsky and David Harel. On the power of bounded concurrency I: Finite automata. Journal of the ACM, 41(3):517-539, 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.
- Doron Drusinsky and David Harel. On the power of bounded concurrency I: Finite automata. Journal of the ACM, 41(3):517-539, May 1994.
- 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.
- 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.
- Rohit J. Parikh. On context-free languages. Journal of the ACM, 13(4):570-581, October 1966.