Robert McNaughton

发表

Review: N. A. Routledge, Logic on Electronic Computers: A Practical Method for Reducing Expressions to Conjunctive Normal Form

Robert McNaughton, 1959 .

AN INTRODUCTION TO REGULAR EXPRESSIONS

Robert McNaughton, R. McNaughton, 1968 .

Computing the Order of a Locally Testable Automaton

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

Bing Kurt. On simplifying truth-functional formulas. The journal of symbolic logic, vol. 21 (1956), pp. 253–254.

Robert McNaughton, 1957 .

Alan Rose. Many-valued logical machines. Proceedings of the Cambridge Philosophical Society , vol. 54 (1958), pp. 307–321.

Robert McNaughton, 1962 .

Unate Truth Functions

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

Review: A. Nerode, Linear Automaton Transformations

Robert McNaughton, 1963 .

Review: Dean N. Arden, Delayed-Logic and Finite-State Machines

Robert McNaughton, 1971 .

Review: Alan Rose, Many-Valued Logical Machines

Robert McNaughton, 1962 .

Friedman Joyce. A decision procedure for computations of finite automata. Journal of the Association for Computing Machinery, vol. 9 (1962), pp. 315–323.

Robert McNaughton, 1965 .

C. C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society , vol. 98 (1961), pp. 21–51.

Robert McNaughton, 1969 .

Scheduling with Deadlines and Loss Functions

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

Review: Joyce Friedman, A Decision Procedure for Computations of Finite Automata

Robert McNaughton, 1965 .

Regular Expressions and State Graphs for Automata

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

Review: A. W. Burks, J. B. Wright, Sequence Generators and Digital Computers; Arthur W. Burks, Jesse B. Wright, Sequence Generators, Graphs, and Formal Languages

Robert McNaughton, 1964 .

An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems

Paliath Narendran, Robert McNaughton, Deepak Kapur, 1985, Theor. Comput. Sci..

Review: R. J. Nelson, Introduction to Automata

Robert McNaughton, 1971 .

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).

A Theorem About Infinite-Valued Sentential Logic

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

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

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

Some Formal Relative Consistency Proofs

Robert McNaughton, 1953, J. Symb. Log..

The Development of Formal Language Theory Since 1956 (Review Paper)

Robert McNaughton, 1990, Int. J. Found. Comput. Sci..

Church-Rosser Thue systems and formal languages

Paliath Narendran, Robert McNaughton, Friedrich Otto, 1988, JACM.

Review: A. Mostowski, On Models of Axiomatic Systems

Robert McNaughton, 1954 .

Infinite Games Played on Finite Graphs

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

An Insertion into the Chomsky Hierarchy?

Robert McNaughton, 1999, Jewels are Forever.

Some Remarks

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

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).

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

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

An Upper Bound on the Order of Locally Testable Deterministic Finite Automata

Sam M. Kim, Robert McNaughton, Robert McCloskey, 1989, Optimal Algorithms.

The Undecidability of the Preperfectness of Thue Systems

Paliath Narendran, Robert McNaughton, 1984, Theor. Comput. Sci..

Elementary Problems: E3409-E3414

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

Review: Frederic B. Fitch, (Sintez cifrovyh avtomatov):Representation of Sequential Circuits in Combinatory Logic

Robert McNaughton, 1965 .

Algebraic decision procedures for local testability

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

The Church-Rosser Property and Special Thue Systems

Paliath Narendran, Robert McNaughton, Deepak Kapur, 1985, Theor. Comput. Sci..

Fitch Frederic B.. Representation of sequential circuits in combinatory logic. Philosophy of science, vol. 25 (1958), pp. 263–279.

Robert McNaughton, 1965 .

Varieties of Formal Languages (J. E. Pin; A. Howie, trans.)

Robert McNaughton, 1989, SIAM Rev..

Review of "Introduction to languages, machines and logic: computable languages, abstract machines and formal logic" by Alan P. Parkes. Springer-Verlag 2002.

Robert McNaughton, 2004, SIGA.

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

Sam M. Kim, Robert McNaughton, Robert McCloskey, 1989, WADS.

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).

Regularity-Preserving Relations

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

Review: Arthur W. Burks, Irving M. Copi, The Logical Design of an Idealized General-Purpose Computer

Robert McNaughton, 1957 .

The Loop Complexity of Pure-Group Events

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

The loop complexity of regular events

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

Semi-Thue Systems with an Inhibitor

Robert McNaughton, 2004, Journal of Automated Reasoning.

Contributions of Ronald V. Book to the Theory of String-Rewriting Systems

Robert McNaughton, 1998, Theor. Comput. Sci..

Finite automata and badly timed elements

Robert McNaughton, 1963, SWCT.

Book's Impact on the Theory of Thue Systems - Abstract

Robert McNaughton, 1997, Advances in Algorithms, Languages, and Complexity.

Testing and Generating Infinite Sequences by a Finite Automaton

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

Parenthesis Grammars

Robert McNaughton, R. McNaughton, 1967, JACM.

The Finiteness of Finitely Presented Monoids

Robert McNaughton, 1998, Theor. Comput. Sci..

Review: Kurt Bing, On Simplifying Truth-Functional Formulas

Robert McNaughton, 1957 .

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).

The Theory of Automata, a Survey

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

Introduction to Formal Languages (G. E. Revesz)

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

Computing the Order of a Locally Testable Automaton

Sam M. Kim, Robert McNaughton, 1994, SIAM J. Comput..

Nerode A.. Linear automaton transformations. Proceedings of the American Mathematical Society , vol. 9 (1958), pp. 541–544.

Robert McNaughton, 1963 .

Playing Infinite Games in Finite Time

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

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

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

A decision procedure for generalized sequential mapability-onto of regular sets

Robert McNaughton, 1971, STOC '71.

The theory of automata

Robert McNaughton, R. McNaughton, 1961 .

An Efficient Algorithm for Local Testability Problem of Finite State Automata

Sam M. Kim, Robert McNaughton, 1995, COCOON.

Buchi J. Richard and Landweber Lawrence H.. Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society , vol. 138 (1969), pp. 295–311.

Robert McNaughton, 1972 .

Robinson Raphael M.. Restricted set-theoretical definitions in arithmetic. Proceedings of the American Mathematical Society , vol. 9 (1958), pp. 238–242. Robinson Raphael M.. Restricted set-theoretical definitions in arithmetic. Summaries of talks presented at the Summer Institute for Symbolic Logic

Robert McNaughton, 1966 .

Review: Alfred Tarski, A decision method for elementary algebra and geometry

Robert McNaughton, 1953 .

Review: Hao Wang, The Irreducibility of Impredicative Principles

Robert McNaughton, 1953 .

The folded tree

Robert McNaughton, Arthur W. Burks, Jesse B. Wright, 1955 .

Review: R. E. Stearns, J. Hartmanis, Regularity Preserving Modifications of Regular Expressions

Robert McNaughton, 1966 .

A non-standard truth definition

Robert McNaughton, R. McNaughton, 1954 .

Well behaved derivations in one-rule semi-Thue systems

Robert McNaughton, 1995 .

Review: N. E. Kobrinskii, B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata

Robert McNaughton, 1968 .

Review: Raymond J. Nelson, Simplest Normal Truth Functions; W. V. Quine, A Way to Simplify Truth Functions

Robert McNaughton, 1956 .

A Metrical Concept of Happiness

Robert McNaughton, 1953 .

On the measure of normal formulas.

Robert McNaughton, 1957 .

The Burnside problem for semigroups

Yechezkel Zalcstein, Robert McNaughton, 1975 .

Special monoids and special thue systems

Paliath Narendran, Robert McNaughton, 1987 .

Review: C. Ryll-Nardzewski, The Role of the Axiom of Induction in Elementary Arithmetic

Robert McNaughton, 1954 .