R. McNaughton

发表

The minimality of rectifier nets with multiple outputs incompletely specified

R. McNaughton, Bernon Mitchell, 1957 .

R. McNaughton, S. Papert, 1971 .

Complete Decoding Nets: General Theory and Minimality

Don W. Warren, A. Burks, J. Wright, 1954 .

Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic

R. McNaughton, 1963, Journal of Symbolic Logic.

Elementary Computability, Formal Languages, and Automata

R. McNaughton, 1981 .

The Theory of Automata, a Survey

Robert McNaughton, R. McNaughton, 1961, Adv. Comput..

Counter-Free Automata (M.I.T. research monograph no. 65)

Robert McNaughton, Seymour A. Papert, R. McNaughton, 1971 .

Techniques for Manipulating Regular Expressions

R. McNaughton, 1967 .

Regular Expressions and State Graphs for Automata

Robert McNaughton, Hisao Yamada, R. McNaughton, 1960, IRE Trans. Electron. Comput..

A Theorem About Infinite-Valued Sentential Logic

Robert McNaughton, R. McNaughton, 1951, J. Symb. Log..

Review: C. C. Elgot, Decision Problems of Finite Automata Design and Related Arithmetics

R. McNaughton, 1969 .

Computing the Order of a Locally Testable Automaton

Sam M. Kim, Robert McNaughton, R. McNaughton, 1991, FSTTCS.

Elementary Problems: E3409-E3414

Robert McNaughton, Donald E. Knuth, Gerald Myerson, 1990 .

Elementary Problems: E2635-E2640

D. Knuth, R. McNaughton, K. C. Smith, 1977 .

Review: Joyce Friedman, Some Results in Church's Restricted Recursive Arithmetic

R. McNaughton, 1959 .

The theory of automata

Robert McNaughton, R. McNaughton, 1961 .

Some Remarks

Robert McNaughton, R. McNaughton, 1891, Mathematical systems theory.

Unate Truth Functions

Robert McNaughton, R. McNaughton, 1961, IRE Trans. Electron. Comput..

Automata, formal languages abstract switching, and computability in a Ph.D. computer science program

Robert McNaughton, R. McNaughton, 1968, Commun. ACM.

Testing and Generating Infinite Sequences by a Finite Automaton

Robert McNaughton, R. McNaughton, 1966, Inf. Control..

Algebraic decision procedures for local testability

Robert McNaughton, R. McNaughton, 1974, Mathematical systems theory.

McCluskey E. J. Jr. Minimization of Boolean functions. The Bell System technical journal , vol. 35 (1956), pp. 1417–1444.

Robert McNaughton, R. McNaughton, 1958, Journal of Symbolic Logic (JSL).

Scheduling with Deadlines and Loss Functions

Robert McNaughton, R. McNaughton, Robert McNaughton, 1959 .

Computing the Order of a Locally Testable Automaton

José M. Sempere, R. McNaughton, J. Sempere, 1991, SIAM J. Comput..

Infinite Games Played on Finite Graphs

Robert McNaughton, R. McNaughton, 1993, Ann. Pure Appl. Logic.

A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata

Sam M. Kim, Robert McNaughton, Robert McCloskey, 1989, IEEE Trans. Computers.

Routledge N. A.. Logic on electronic computers: A practical method for reducing expressions to conjunctive normal form. Proceedings of the Cambridge Philosophical Society, vol. 52 (1956), pp. 161–173.

Robert McNaughton, R. McNaughton, 1959, Journal of Symbolic Logic (JSL).

AN INTRODUCTION TO REGULAR EXPRESSIONS

Robert McNaughton, R. McNaughton, 1968 .

The loop complexity of regular events

Robert McNaughton, R. McNaughton, 1969, Inf. Sci..

Nelson Raymond J.. Simplest normal truth functions. The journal of symbolic logic, vol. 20 (1955), pp. 105–108.Quine W. V.. A way to simplify truth functions. The American mathematical monthly, vol. 62 (1955), pp. 627–631.

Robert McNaughton, R. McNaughton, 1956, Journal of Symbolic Logic (JSL).

Rose Gene F.. Output completeness in sequential machines. Proceedings of the American Mathematical Society , vol. 13 (1962), pp. 611–614.

Robert McNaughton, R. McNaughton, 1966, Journal of Symbolic Logic (JSL).

Playing Infinite Games in Finite Time

Robert McNaughton, R. McNaughton, 2001, A Half-Century of Automata Theory.

Regularity-Preserving Relations

Robert McNaughton, Joel I. Seiferas, R. McNaughton, 1976, Theor. Comput. Sci..

Introduction to Formal Languages (G. E. Revesz)

Robert McNaughton, R. McNaughton, 1989, SIAM Review.

Parenthesis Grammars

Robert McNaughton, R. McNaughton, 1967, JACM.

Information science: The loop complexity of regular events

R. McNaughton, 1969 .

The Loop Complexity of Pure-Group Events

Robert McNaughton, R. McNaughton, 1967, Inf. Control..

A non-standard truth definition

Robert McNaughton, R. McNaughton, 1954 .