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