Robert McNaughton | Academic Influence

Robert McNaughton's AcademicInfluence.com Rankings

Robert McNaughton

Computer Science

#4053

World Rank

#4264

Historical Rank

#1407

USA Rank

Theoretical Computer Science

#60

World Rank

#60

Historical Rank

#19

USA Rank

computer-science Degrees

Robert McNaughton

Mathematics

#5272

World Rank

#7432

Historical Rank

#1751

USA Rank

Measure Theory

#934

World Rank

#1219

Historical Rank

#347

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Robert McNaughton's Degrees

PhD Mathematics Princeton University
Bachelors Mathematics University of Chicago

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Robert McNaughton Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Robert Forbes McNaughton, Jr. was an American mathematician, logician, and computer scientist with several key contributions in formal languages, grammars and rewriting systems, and word combinatorics.

(See a Problem?)

Robert McNaughton's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Counter-Free Automata (1971) (926)
Scheduling with Deadlines and Loss Functions (1959) (859)
Testing and Generating Infinite Sequences by a Finite Automaton (1966) (562)
Regular Expressions and State Graphs for Automata (1960) (541)
Infinite Games Played on Finite Graphs (1993) (340)
A theorem about infinite-valued sentential logic (1951) (308)
Counter-Free Automata (M.I.T. research monograph no. 65) (1971) (266)
Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic (1963) (205)
Parenthesis Grammars (1967) (189)
Church-Rosser Thue systems and formal languages (1988) (128)
The theory of automata (1961) (95)
Algebraic decision procedures for local testability (1974) (84)
Unate Truth Functions (1961) (81)
Effects & techniques (2008) (66)
The Burnside problem for semigroups (1975) (52)
The Loop Complexity of Pure-Group Events (1967) (52)
The Theory of Automata, a Survey (1961) (51)
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata (1989) (51)
Review: C. C. Elgot, Decision Problems of Finite Automata Design and Related Arithmetics (1969) (42)
The loop complexity of regular events (1969) (41)
Computing the Order of a Locally Testable Automaton (1991) (34)
Regularity-Preserving Relations (1976) (33)
Elementary Computability, Formal Languages, and Automata (1981) (29)
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems (1985) (22)
A Metrical Concept of Happiness (1953) (21)
Well behaved derivations in one-rule semi-Thue systems (1995) (17)
Complete Decoding Nets: General Theory and Minimality (1954) (16)
Playing Infinite Games in Finite Time (2001) (15)
An Insertion into the Chomsky Hierarchy? (1999) (14)
The Undecidability of the Preperfectness of Thue Systems (1984) (14)
Techniques for Manipulating Regular Expressions (1967) (14)
Semi-Thue Systems with an Inhibitor (2001) (14)
The minimality of rectifier nets with multiple outputs incompletely specified (1957) (13)
Review: Raymond J. Nelson, Simplest Normal Truth Functions; W. V. Quine, A Way to Simplify Truth Functions (1956) (13)
Special monoids and special thue systems (1987) (9)
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata (1989) (8)
Review: Alfred Tarski, A decision method for elementary algebra and geometry (1953) (7)
The folded tree (1955) (7)
Introduction to Formal Languages (G. E. Revesz) (1989) (6)
Some formal relative consistency proofs (1953) (5)
Finite automata and badly timed elements (1963) (5)
A decision procedure for generalized sequential mapability-onto of regular sets (1971) (4)
Review: Arthur W. Burks, Irving M. Copi, The Logical Design of an Idealized General-Purpose Computer (1957) (2)
On the measure of normal formulas. (1957) (2)
A non-standard truth definition (1954) (2)
Conceptual Schemes in Set Theory (1957) (2)
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 (1966) (2)
Elementary Problems: E2635-E2640 (1977) (2)
AN INTRODUCTION TO REGULAR EXPRESSIONS (1968) (2)
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program (1968) (2)
Contributions of Ronald V. Book to the Theory of String-Rewriting Systems (1998) (2)
Review: Hao Wang, The Irreducibility of Impredicative Principles (1953) (2)
Review: C. Ryll-Nardzewski, The Role of the Axiom of Induction in Elementary Arithmetic (1954) (2)
The Finiteness of Finitely Presented Monoids (1998) (2)
Review: R. E. Stearns, J. Hartmanis, Regularity Preserving Modifications of Regular Expressions (1966) (1)
Review: N. E. Kobrinskii, B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata (1968) (1)
C. C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society , vol. 98 (1961), pp. 21–51. (1969) (1)
Review: A. W. Burks, J. B. Wright, Sequence Generators and Digital Computers; Arthur W. Burks, Jesse B. Wright, Sequence Generators, Graphs, and Formal Languages (1964) (1)
McCluskey E. J. Jr. Minimization of Boolean functions. The Bell System technical journal , vol. 35 (1956), pp. 1417–1444. (1958) (1)
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. (1956) (1)
The Church-Rosser Property and Special Thue Systems (1985) (1)
Review: J. M. Pugmire, A. Rose, Formulae Corresponding to Universal Decision Elements; A. Rose, The Use of Universal Decision Elements as Flip-Flops; Alan Rose, Nouvelle Methode pour Determiner les Formules qui Correspondent a des elements universels de decision (1962) (1)
Review: J. Barkley Rosser, Axiomatization of Infinite Valued Logics (1962) (1)
The Development of Formal Language Theory Since 1956 (Review Paper) (1990) (1)
A differential method for reasoning by analogy (1987) (1)
Undefinability of addition from one unary operator (1965) (1)
Review: Joyce Friedman, Some Results in Church's Restricted Recursive Arithmetic (1959) (1)
Review: E. J. McCluskey, Minimization of Boolean Functions (1958) (0)
Friedman Joyce. A decision procedure for computations of finite automata. Journal of the Association for Computing Machinery, vol. 9 (1962), pp. 315–323. (1965) (0)
Review: Frederic B. Fitch, (Sintez cifrovyh avtomatov):Representation of Sequential Circuits in Combinatory Logic (1965) (0)
Review: Kurt Bing, On Simplifying Truth-Functional Formulas (1957) (0)
Measurement Techniques For Evaluation AndQuality Assurance Of Expert Systems (1970) (0)
Review: Raymond J. Nelson, Weak Simplest Normal Truth Functions (1956) (0)
Varieties of Formal Languages (J. E. Pin; A. Howie, trans.) (1989) (0)
Elementary Problems: E3409-E3414 (1990) (0)
Review: Joyce Friedman, A Decision Procedure for Computations of Finite Automata (1965) (0)
Nerode A.. Linear automaton transformations. Proceedings of the American Mathematical Society , vol. 9 (1958), pp. 541–544. (1963) (0)
Axiomatic Systems, Conceptual Schemes, and the Consistency of Mathematical Theories (1954) (0)
Alan Rose. Many-valued logical machines. Proceedings of the Cambridge Philosophical Society , vol. 54 (1958), pp. 307–321. (1962) (0)
Review: A. Mostowski, On Models of Axiomatic Systems (1954) (0)
Stearns R. E. and Hartmanis J.. Regularity preserving modifications of regular expressions. Information and control, vol. 6 (1963), pp. 55–69. (1966) (0)
Review: Alan Rose, Many-Valued Logical Machines (1962) (0)
IX. Sequential Circuits - Part B: Behavioral Properties (1964) (0)
Review: N. A. Routledge, Logic on Electronic Computers: A Practical Method for Reducing Expressions to Conjunctive Normal Form (1959) (0)
Book's Impact on the Theory of Thue Systems - Abstract (1997) (0)
Rose Alan. Some self-dual primitive functions for propositional calculi. Mathematische Annalen, vol. 126 (1953), pp. 144–148. (1954) (0)
Computability & unsolvability: by Martin Davis. 210 pages, 6 × 9 in. New York, McGraw-Hill Book Co., Inc., 1958. Price, $7.50 (1959) (0)
Rose Gene F.. Output completeness in sequential machines. Proceedings of the American Mathematical Society , vol. 13 (1962), pp. 611–614. (1966) (0)
Bing Kurt. On simplifying truth-functional formulas. The journal of symbolic logic, vol. 21 (1956), pp. 253–254. (1957) (0)
Review: Gene F. Rose, Output Completeness in Sequential Machines (1966) (0)
Review: Alan Rose, Sur les Elements Universels de Decision (1959) (0)
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. (1959) (0)
Review: S. C. Kleene, Papers on Predicate Calculus (1954) (0)
Curriculum and Methods (EDS 300). (1975) (0)
Review: J. Richard Buchi, Lawrence H. Landweber, Solving Sequential Conditions by finite-state stategies (1972) (0)
Review: A. Nerode, Linear Automaton Transformations (1963) (0)
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. (1972) (0)
Review: Dean N. Arden, Delayed-Logic and Finite-State Machines (1971) (0)
Review: E. J. McCluskey, Detection of Group Invariance or Total Symmetry of a Boolean Function (1958) (0)
An Efficient Algorithm for Local Testability Problem of Finite State Automata (1995) (0)
Rosser J. Barkley. Axiomatization of infinite valued logics. Logique et analyse (Louvain), n.s. vol. 3 (1960), pp. 137–153. (1962) (0)
Review of "Introduction to languages, machines and logic: computable languages, abstract machines and formal logic" by Alan P. Parkes. Springer-Verlag 2002. (2004) (0)
Arthur W. Burks and Irving M. Copi. The logical design of an idealized general-purpose computer. Journal of the Franklin Institute , vol. 261 (1956), pp. 299–314, 421–436. (1957) (0)
Niche : Installations, Interventions, Performances (1995) (0)
Review: Raphael M. Robinson, Restricted Set-Theoretical Definitions in Arithmetic (1966) (0)
Review: R. J. Nelson, Introduction to Automata (1971) (0)
Switching Circuits and Logical Design (Samuel H. Caldvvell) (1959) (0)
UNDEFINABILITY OF ADDITION FROM ONE UNARY OPERATOR 0) (2010) (0)
Fraenkel Abraham A.. Abstract set theory. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam 1953, XII + 479 pp. (1955) (0)
Review: Antonin Svoboda, Graphico-Mechanical Aids for the Synthesis of Relay Circuits (1958) (0)
Fitch Frederic B.. Representation of sequential circuits in combinatory logic. Philosophy of science, vol. 25 (1958), pp. 263–279. (1965) (0)
E. J. McCluskey Jr. Detection of group invariance or total symmetry of a Boolean function. The Bell System technical journal , vol. 35 (1956), pp. 1445–1453. (1958) (0)
Nelson Raymond J.. Weak simplest normal truth functions. The journal of symbolic logic, vol. 20 (1955) pp. 232–234. (1956) (0)
R. J. Nelson. Introduction to automata. John Wiley a Sons, Inc., New York-London-Sydney1968, xii + 400 pp. (1971) (0)
Review: Alan Rose, Some Self-Dual Primitive Functions for Propositional Calculi (1954) (0)
C. Ryll-Nardzewski. The role of the axiom of induction in elementary arithmetic. Fundamenta mathematicae , vol. 39 (for 1952, pub. 1953), pp. 239–263. (1954) (0)

This paper list is powered by the following services:

Other Resources About Robert McNaughton

en.wikipedia.org

What Schools Are Affiliated With Robert McNaughton?

Robert McNaughton is affiliated with the following schools: