- Michael A. Harrison. The
number of classes of invertible Boolean functions. Journal of
the ACM, 10(1):25-28, January 1963.
Citations.
- Michael A. Harrison. On
asymptotic estimates in switching and automata theory. Journal
of the ACM, 13(1):151-157, January 1966.
References.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and
compiling. Journal of the ACM, 14(1):172-201, January
1967.
References
and Citations.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata.
Journal of the ACM, 14(2):389-418, April 1967.
References
and Citations.
- Seymour Ginsburg and Michael A. Harrison. One-way nondeterministic
real-time list-storage languages. Journal of the ACM,
15(3):428-446, July 1968.
References
and Citations.
- Michael A. Harrison and Mario Schkolnick. A grammatical characterization of
one-way nondeterministic stack languages. Journal of the
ACM, 18(2):148-172, April 1971.
References,
Citations,
etc.
- James N. Gray and Michael A. Harrison. On the covering and reduction
problems for context-free grammars. Journal of the ACM,
19(4):675-698, October 1972.
References,
Citations,
etc.
- James N. Gray and Michael A. Harrison. Canonical precedence schemes.
Journal of the ACM, 20(2):214-234, April 1973.
References,
Citations,
etc.
- Michael A. Harrison and Ivan M. Havel. On the parsing of deterministic
languages. Journal of the ACM, 21(4):525-548, October
1974.
References,
Citations,
etc.
Shortcuts: