Search the dblp DataBase
Robert McNaughton :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Robert McNaughton Book's Impact on the Theory of Thue Systems - Abstract. [Citation Graph (0, 0)][DBLP ] Advances in Algorithms, Languages, and Complexity, 1997, pp:189-190 [Conf ] Robert McNaughton An Insertion into the Chomsky Hierarchy? [Citation Graph (0, 0)][DBLP ] Jewels are Forever, 1999, pp:204-212 [Conf ] Sam M. Kim , Robert McNaughton An Efficient Algorithm for Local Testability Problem of Finite State Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:597-606 [Conf ] Robert McNaughton Finite automata and badly timed elements [Citation Graph (0, 0)][DBLP ] FOCS, 1963, pp:117-130 [Conf ] Sam M. Kim , Robert McNaughton Computing the Order of a Locally Testable Automaton. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1991, pp:186-211 [Conf ] Robert McNaughton Playing Infinite Games in Finite Time. [Citation Graph (0, 0)][DBLP ] A Half-Century of Automata Theory, 2000, pp:73-91 [Conf ] Sam M. Kim , Robert McNaughton , Robert McCloskey An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] Optimal Algorithms, 1989, pp:48-65 [Conf ] Robert McNaughton A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets [Citation Graph (0, 0)][DBLP ] STOC, 1971, pp:206-218 [Conf ] Sam M. Kim , Robert McNaughton , Robert McCloskey A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] WADS, 1989, pp:420-436 [Conf ] Robert McNaughton The Theory of Automata, a Survey. [Citation Graph (0, 0)][DBLP ] Advances in Computers, 1961, v:2, n:, pp:379-421 [Journal ] Robert McNaughton Infinite Games Played on Finite Graphs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1993, v:65, n:2, pp:149-184 [Journal ] Robert McNaughton Automata, formal languages abstract switching, and computability in a Ph.D. computer science program. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1968, v:11, n:11, pp:738-740 [Journal ] Robert McNaughton Testing and Generating Infinite Sequences by a Finite Automaton [Citation Graph (0, 0)][DBLP ] Information and Control, 1966, v:9, n:5, pp:521-530 [Journal ] Robert McNaughton The Loop Complexity of Pure-Group Events [Citation Graph (0, 0)][DBLP ] Information and Control, 1967, v:11, n:1/2, pp:167-176 [Journal ] Robert McNaughton The Development of Formal Language Theory Since 1956 (Review Paper). [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1990, v:1, n:4, pp:355-368 [Journal ] Robert McNaughton , Paliath Narendran , Friedrich Otto Church-Rosser Thue systems and formal languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1988, v:35, n:2, pp:324-344 [Journal ] Robert McNaughton Parenthesis Grammars. [Citation Graph (0, 0)][DBLP ] J. ACM, 1967, v:14, n:3, pp:490-500 [Journal ] Robert McNaughton Semi-Thue Systems with an Inhibitor. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2001, v:26, n:4, pp:409-431 [Journal ] Robert McNaughton A Theorem About Infinite-Valued Sentential Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1951, v:16, n:1, pp:1-13 [Journal ] Robert McNaughton Some Formal Relative Consistency Proofs. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1953, v:18, n:2, pp:136-144 [Journal ] Robert McNaughton Algebraic Decision Procedures for Local Testability. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1974, v:8, n:1, pp:60-76 [Journal ] Robert McNaughton Some Remarks. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1990, v:23, n:3, pp:145-146 [Journal ] Sam M. Kim , Robert McNaughton Computing the Order of a Locally Testable Automaton. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:6, pp:1193-1215 [Journal ] Sam M. Kim , Robert McNaughton , Robert McCloskey A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1991, v:40, n:10, pp:1087-1093 [Journal ] Deepak Kapur , Mukkai S. Krishnamoorthy , Robert McNaughton , Paliath Narendran An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:35, n:, pp:109-114 [Journal ] Deepak Kapur , Paliath Narendran , Mukkai S. Krishnamoorthy , Robert McNaughton The Church-Rosser Property and Special Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:123-133 [Journal ] Robert McNaughton The Finiteness of Finitely Presented Monoids. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:204, n:1-2, pp:169-182 [Journal ] Robert McNaughton Contributions of Ronald V. Book to the Theory of String-Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:207, n:1, pp:13-23 [Journal ] Paliath Narendran , Robert McNaughton The Undecidability of the Preperfectness of Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1984, v:31, n:, pp:165-174 [Journal ] Joel I. Seiferas , Robert McNaughton Regularity-Preserving Relations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:2, n:2, pp:147-154 [Journal ] Search in 0.002secs, Finished in 0.306secs