Thomas N. Hibbard
- Thomas N. Hibbard. Least
upper bounds on minimal terminal state experiments for two classes of
sequential machines. Journal of the ACM, 8(4):601-612,
October 1961.
References.
- Thomas N. Hibbard. Some
combinatorial properties of certain trees with applications to searching
and sorting. Journal of the ACM, 9(1):13-28, January
1962.
References
and Citations.
- Thomas N. Hibbard. A
simple sorting algorithm. Journal of the ACM,
10(2):142-150, April 1963.
References.
- Seymour Ginsburg and Thomas N. Hibbard. Solvability of machine mappings
of regular sets to regular sets. Journal of the ACM,
11(3):302-312, July 1964.
References.
- Thomas N. Hibbard and Joseph Ullian. The independence of inherent
ambiguity from complementedness among context-free languages.
Journal of the ACM, 13(4):588-593, October 1966.
References
and Citations.
- Thomas N. Hibbard. Context-limited grammars.
Journal of the ACM, 21(3):446-453, July 1974.
References,
etc.
Shortcuts: