Robert McNaughton

Publication Activity (10 Years)

Years Active: 1951-2004
Publications (10 Years): 0

Publications

Robert McNaughton
Review of "Introduction to languages, machines and logic: computable languages, abstract machines and formal logic" by Alan P. Parkes. Springer-Verlag 2002. SIGACT News 35 (2) (2004)
Robert McNaughton
Semi-Thue Systems with an Inhibitor. J. Autom. Reason. 26 (4) (2001)
Robert McNaughton
An Insertion into the Chomsky Hierarchy? Jewels are Forever (1999)
Robert McNaughton
Contributions of Ronald V. Book to the Theory of String-Rewriting Systems. Theor. Comput. Sci. 207 (1) (1998)
Robert McNaughton
The Finiteness of Finitely Presented Monoids. Theor. Comput. Sci. 204 (1-2) (1998)
Robert McNaughton
Book's Impact on the Theory of Thue Systems - Abstract. Advances in Algorithms, Languages, and Complexity (1997)
Sam M. Kim, Robert McNaughton
An Efficient Algorithm for Local Testability Problem of Finite State Automata. COCOON (1995)
Sam M. Kim, Robert McNaughton
Computing the Order of a Locally Testable Automaton. SIAM J. Comput. 23 (6) (1994)
Robert McNaughton
Infinite Games Played on Finite Graphs. Ann. Pure Appl. Logic 65 (2) (1993)
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) (1991)
Sam M. Kim, Robert McNaughton
Computing the Order of a Locally Testable Automaton. FSTTCS (1991)
Robert McNaughton
The Development of Formal Language Theory Since 1956 (Review Paper). Int. J. Found. Comput. Sci. 1 (4) (1990)
Robert McNaughton
Some Remarks. Math. Syst. Theory 23 (3) (1990)
Robert McNaughton
Varieties of Formal Languages (J. E. Pin; A. Howie, trans.). SIAM Rev. 31 (2) (1989)
Robert McNaughton
Introduction to Formal Languages (G. E. Revesz). SIAM Rev. 31 (2) (1989)
Sam M. Kim, Robert McNaughton, Robert McCloskey
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. Optimal Algorithms (1989)
Sam M. Kim, Robert McNaughton, Robert McCloskey
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. WADS (1989)
Robert McNaughton, Paliath Narendran, Friedrich Otto
Church-Rosser Thue systems and formal languages. J. ACM 35 (2) (1988)
Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton
The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. 39 (1985)
Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. Theor. Comput. Sci. 35 (1985)
Paliath Narendran, Robert McNaughton
The Undecidability of the Preperfectness of Thue Systems. Theor. Comput. Sci. 31 (1984)
Joel I. Seiferas, Robert McNaughton
Regularity-Preserving Relations. Theor. Comput. Sci. 2 (2) (1976)
Robert McNaughton
Algebraic Decision Procedures for Local Testability. Math. Syst. Theory 8 (1) (1974)
Robert McNaughton
A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets STOC (1971)
Robert McNaughton
The loop complexity of regular events. Inf. Sci. 1 (3) (1969)
Robert McNaughton
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program. Commun. ACM 11 (11) (1968)
Robert McNaughton
Parenthesis Grammars. J. ACM 14 (3) (1967)
Robert McNaughton
The Loop Complexity of Pure-Group Events Inf. Control. 11 (1/2) (1967)
Robert McNaughton
Testing and Generating Infinite Sequences by a Finite Automaton Inf. Control. 9 (5) (1966)
Robert McNaughton
Finite automata and badly timed elements SWCT (1963)
Robert McNaughton
Unate Truth Functions. IRE Trans. Electron. Comput. 10 (1) (1961)
Robert McNaughton
The Theory of Automata, a Survey. Adv. Comput. 2 (1961)
Robert McNaughton, Hisao Yamada
Regular Expressions and State Graphs for Automata. IRE Trans. Electron. Comput. 9 (1) (1960)
Robert McNaughton
Some Formal Relative Consistency Proofs. J. Symb. Log. 18 (2) (1953)
Robert McNaughton
A Theorem About Infinite-Valued Sentential Logic. J. Symb. Log. 16 (1) (1951)