Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert McNaughton
Person information
- affiliation: Rensselaer Polytechnic Institute, USA
- 1924 - 2014
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j27]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
- [j26]Robert McNaughton:
Semi-Thue Systems with an Inhibitor. J. Autom. Reason. 26(4): 409-431 (2001) - 2000
- [p1]Robert McNaughton:
Playing Infinite Games in Finite Time. A Half-Century of Automata Theory 2000: 73-91
1990 – 1999
- 1999
- [c8]Robert McNaughton:
An Insertion into the Chomsky Hierarchy? Jewels are Forever 1999: 204-212 - 1998
- [j25]Robert McNaughton:
The Finiteness of Finitely Presented Monoids. Theor. Comput. Sci. 204(1-2): 169-182 (1998) - [j24]Robert McNaughton:
Contributions of Ronald V. Book to the Theory of String-Rewriting Systems. Theor. Comput. Sci. 207(1): 13-23 (1998) - 1997
- [c7]Robert McNaughton:
Book's Impact on the Theory of Thue Systems - Abstract. Advances in Algorithms, Languages, and Complexity 1997: 189-190 - 1995
- [c6]Sam M. Kim, Robert McNaughton:
An Efficient Algorithm for Local Testability Problem of Finite State Automata. COCOON 1995: 597-606 - 1994
- [j23]Sam M. Kim, Robert McNaughton:
Computing the Order of a Locally Testable Automaton. SIAM J. Comput. 23(6): 1193-1215 (1994) - 1993
- [j22]Robert McNaughton:
Infinite Games Played on Finite Graphs. Ann. Pure Appl. Logic 65(2): 149-184 (1993) - 1991
- [j21]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) - [c5]Sam M. Kim, Robert McNaughton:
Computing the Order of a Locally Testable Automaton. FSTTCS 1991: 186-211 - 1990
- [j20]Robert McNaughton:
The Development of Formal Language Theory Since 1956 (Review Paper). Int. J. Found. Comput. Sci. 1(4): 355-368 (1990) - [j19]Robert McNaughton:
Some Remarks. Math. Syst. Theory 23(3): 145-146 (1990)
1980 – 1989
- 1989
- [j18]Robert McNaughton:
Varieties of Formal Languages (J. E. Pin; A. Howie, trans.). SIAM Rev. 31(2): 347-348 (1989) - [j17]Robert McNaughton:
Introduction to Formal Languages (G. E. Revesz). SIAM Rev. 31(2): 348 (1989) - [c4]Sam M. Kim, Robert McNaughton, Robert McCloskey:
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. Optimal Algorithms 1989: 48-65 - [c3]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
- [j16]Robert McNaughton, Paliath Narendran, Friedrich Otto:
Church-Rosser Thue systems and formal languages. J. ACM 35(2): 324-344 (1988) - 1985
- [j15]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) - [j14]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
- [j13]Paliath Narendran, Robert McNaughton:
The Undecidability of the Preperfectness of Thue Systems. Theor. Comput. Sci. 31: 165-174 (1984)
1970 – 1979
- 1976
- [j12]Joel I. Seiferas, Robert McNaughton:
Regularity-Preserving Relations. Theor. Comput. Sci. 2(2): 147-154 (1976) - 1974
- [j11]Robert McNaughton:
Algebraic Decision Procedures for Local Testability. Math. Syst. Theory 8(1): 60-76 (1974) - 1971
- [c2]Robert McNaughton:
A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets. STOC 1971: 206-218
1960 – 1969
- 1969
- [j10]Robert McNaughton:
The loop complexity of regular events. Inf. Sci. 1(3): 305-328 (1969) - 1968
- [j9]Robert McNaughton:
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program. Commun. ACM 11(11): 738-740 (1968) - 1967
- [j8]Robert McNaughton:
The Loop Complexity of Pure-Group Events. Inf. Control. 11(1/2): 167-176 (1967) - [j7]Robert McNaughton:
Parenthesis Grammars. J. ACM 14(3): 490-500 (1967) - 1966
- [j6]Robert McNaughton:
Testing and Generating Infinite Sequences by a Finite Automaton. Inf. Control. 9(5): 521-530 (1966) - 1963
- [c1]Robert McNaughton:
Finite automata and badly timed elements. SWCT 1963: 117-130 - 1961
- [j5]Robert McNaughton:
The Theory of Automata, a Survey. Adv. Comput. 2: 379-421 (1961) - [j4]Robert McNaughton:
Unate Truth Functions. IRE Trans. Electron. Comput. 10(1): 1-6 (1961) - 1960
- [j3]Robert McNaughton, Hisao Yamada:
Regular Expressions and State Graphs for Automata. IRE Trans. Electron. Comput. 9(1): 39-47 (1960)
1950 – 1959
- 1953
- [j2]Robert McNaughton:
Some Formal Relative Consistency Proofs. J. Symb. Log. 18(2): 136-144 (1953) - 1951
- [j1]Robert McNaughton:
A Theorem About Infinite-Valued Sentential Logic. J. Symb. Log. 16(1): 1-13 (1951)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
