Robert McCloskey

	1991
3		Sam M. Kim, Robert McNaughton, Robert McCloskey: A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. IEEE Trans. Computers 40(10): 1087-1093 (1991)
	1989
2		Sam M. Kim, Robert McNaughton, Robert McCloskey: An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. Optimal Algorithms 1989: 48-65
1		Sam M. Kim, Robert McNaughton, Robert McCloskey: A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. WADS 1989: 420-436

Coauthor Index

1	Sam M. Kim	[1] [2] [3]
2	Robert McNaughton	[1] [2] [3]

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page