A Theorem About Infinite-Valued Sentential Logic. - Robert McNaughton (J. Symb. Log., 1951)

Some Formal Relative Consistency Proofs. - Robert McNaughton (J. Symb. Log., 1953)

Regular Expressions and State Graphs for Automata. - Robert McNaughton; Hisao Yamada (IRE Trans. Electron. Comput., 1960)

The Theory of Automata, a Survey. - Robert McNaughton (Adv. Comput., 1961)

Unate Truth Functions. - Robert McNaughton (IRE Trans. Electron. Comput., 1961)

Finite automata and badly timed elements - Robert McNaughton (SWCT, 1963)

Testing and Generating Infinite Sequences by a Finite Automaton - Robert McNaughton (Inf. Control., 1966)

The Loop Complexity of Pure-Group Events - Robert McNaughton (Inf. Control., 1967)

Parenthesis Grammars. - Robert McNaughton (J. ACM, 1967)

Automata, formal languages abstract switching, and computability in a Ph.D. computer science program. - Robert McNaughton (Commun. ACM, 1968)

The loop complexity of regular events. - Robert McNaughton (Inf. Sci., 1969)

A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets - Robert McNaughton (STOC, 1971)

Algebraic Decision Procedures for Local Testability. - Robert McNaughton (Math. Syst. Theory, 1974)

Regularity-Preserving Relations. - Joel I. Seiferas; Robert McNaughton (Theor. Comput. Sci., 1976)

The Undecidability of the Preperfectness of Thue Systems. - Paliath Narendran; Robert McNaughton (Theor. Comput. Sci., 1984)

An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. - Deepak Kapur; Mukkai S. Krishnamoorthy; Robert McNaughton; Paliath Narendran (Theor. Comput. Sci., 1985)

The Church-Rosser Property and Special Thue Systems. - Deepak Kapur; Paliath Narendran; Mukkai S. Krishnamoorthy; Robert McNaughton (Theor. Comput. Sci., 1985)

Church-Rosser Thue systems and formal languages. - Robert McNaughton; Paliath Narendran; Friedrich Otto (J. ACM, 1988)

An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. - Sam M. Kim; Robert McNaughton; Robert McCloskey (Optimal Algorithms, 1989)

Varieties of Formal Languages (J. E. Pin; A. Howie, trans.). - Robert McNaughton (SIAM Rev., 1989)

Introduction to Formal Languages (G. E. Revesz). - Robert McNaughton (SIAM Rev., 1989)

The Development of Formal Language Theory Since 1956 (Review Paper). - Robert McNaughton (Int. J. Found. Comput. Sci., 1990)

Some Remarks. - Robert McNaughton (Math. Syst. Theory, 1990)

A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. - Sam M. Kim; Robert McNaughton; Robert McCloskey (IEEE Trans. Computers, 1991)

Infinite Games Played on Finite Graphs. - Robert McNaughton (Ann. Pure Appl. Logic, 1993)

Computing the Order of a Locally Testable Automaton. - Sam M. Kim; Robert McNaughton (SIAM J. Comput., 1994)

An Efficient Algorithm for Local Testability Problem of Finite State Automata. - Sam M. Kim; Robert McNaughton (COCOON, 1995)

Book's Impact on the Theory of Thue Systems - Abstract. - Robert McNaughton (Advances in Algorithms, Languages, and Complexity, 1997)

The Finiteness of Finitely Presented Monoids. - Robert McNaughton (Theor. Comput. Sci., 1998)

Contributions of Ronald V. Book to the Theory of String-Rewriting Systems. - Robert McNaughton (Theor. Comput. Sci., 1998)

An Insertion into the Chomsky Hierarchy? - Robert McNaughton (Jewels are Forever, 1999)

Playing Infinite Games in Finite Time. - Robert McNaughton (A Half-Century of Automata Theory, 2000)

Semi-Thue Systems with an Inhibitor. - Robert McNaughton (J. Autom. Reason., 2001)

Review of "Introduction to languages, machines and logic: computable languages, abstract machines and formal logic" by Alan P. Parkes. Springer-Verlag 2002. - Robert McNaughton (SIGACT News, 2004)