The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert McNaughton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.231secs, Finished in 0.232secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002