Robert McNaughton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2004

Review of Introduction to languages, machines and logic: computable languages, abstract machines and formal logic by Alan P. Parkes. Springer-Verlag 2002Robert McNaughton. sigact, 35(2):13-14, 2004. [doi]

2001

Semi-Thue Systems with an InhibitorRobert McNaughton. JAR, 26(4):409-431, 2001.

2000

Playing Infinite Games in Finite TimeRobert McNaughton. hcat 2000: 73-91

1999

An Insertion into the Chomsky Hierarchy?Robert McNaughton. BIRTHDAY 1999: 204-212

1998

The Finiteness of Finitely Presented MonoidsRobert McNaughton. TCS, 204(1-2):169-182, 1998. [doi]

Contributions of Ronald V. Book to the Theory of String-Rewriting SystemsRobert McNaughton. TCS, 207(1):13-23, 1998. [doi]

1997

Book s Impact on the Theory of Thue Systems - AbstractRobert McNaughton. BIRTHDAY 1997: 189-190

1995

An Efficient Algorithm for Local Testability Problem of Finite State AutomataSam M. Kim, Robert McNaughton. cocoon 1995: 597-606

1994

Computing the Order of a Locally Testable AutomatonSam M. Kim, Robert McNaughton. SICOMP, 23(6):1193-1215, 1994.

1993

Infinite Games Played on Finite GraphsRobert McNaughton. APAL, 65(2):149-184, 1993.

1991

A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite AutomataSam M. Kim, Robert McNaughton, Robert McCloskey. TC, 40(10):1087-1093, 1991.

Computing the Order of a Locally Testable AutomatonSam M. Kim, Robert McNaughton. fsttcs 1991: 186-211

1990

Some RemarksRobert McNaughton. mst, 23(3):145-146, 1990.

The Development of Formal Language Theory Since 1956 (Review Paper)Robert McNaughton. ijfcs, 1(4):355-368, 1990.

1989

A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite AutomataSam M. Kim, Robert McNaughton, Robert McCloskey. wads 1989: 420-436

An Upper Bound on the Order of Locally Testable Deterministic Finite AutomataSam M. Kim, Robert McNaughton, Robert McCloskey. oa 1989: 48-65

Varieties of Formal Languages (J. E. Pin; A. Howie, trans.)Robert McNaughton. siamrev, 31(2):347-348, 1989. [doi]

Introduction to Formal Languages (G. E. Revesz)Robert McNaughton. siamrev, 31(2):348, 1989. [doi]

1988

Church-Rosser Thue systems and formal languagesRobert McNaughton, Paliath Narendran, Friedrich Otto. JACM, 35(2):324-344, 1988. [doi]

1985

An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue SystemsDeepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran. TCS, 35:109-114, 1985.

The Church-Rosser Property and Special Thue SystemsDeepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton. TCS, 39:123-133, 1985.

1984

The Undecidability of the Preperfectness of Thue SystemsPaliath Narendran, Robert McNaughton. TCS, 31:165-174, 1984.

1976

Regularity-Preserving RelationsJoel I. Seiferas, Robert McNaughton. TCS, 2(2):147-154, 1976.

1974

Algebraic Decision Procedures for Local TestabilityRobert McNaughton. mst, 8(1):60-76, 1974.

1971

A Decision Procedure for Generalized Sequential Mapability-onto of Regular SetsRobert McNaughton. stoc 1971: 206-218

1969

The loop complexity of regular eventsRobert McNaughton. isci, 1(3):305-328, 1969. [doi]

1968

Automata, formal languages abstract switching, and computability in a Ph.D. computer science programRobert McNaughton. CACM, 11(11):738-740, 1968. [doi]

1967

The Loop Complexity of Pure-Group EventsRobert McNaughton. iandc, 11(1/2):167-176, July-August 1967.

Parenthesis GrammarsRobert McNaughton. JACM, 14(3):490-500, 1967. [doi]

1966

Testing and Generating Infinite Sequences by a Finite AutomatonRobert McNaughton. iandc, 9(5):521-530, October 1966.

1963

Finite automata and badly timed elementsRobert McNaughton. focs 1963: 117-130

1961

The Theory of Automata, a SurveyRobert McNaughton. ac, 2:379-421, 1961.

Unate Truth FunctionsRobert McNaughton. TC, 10(1):1-6, 1961. [doi]

1960

Regular Expressions and State Graphs for AutomataRobert McNaughton, Hisao Yamada. TC, 9(1):39-47, 1960. [doi]

1953

Some Formal Relative Consistency ProofsRobert McNaughton. JSYML, 18(2):136-144, 1953.

1951

A Theorem About Infinite-Valued Sentential LogicRobert McNaughton. JSYML, 16(1):1-13, 1951.

Sign in or sign up to see more results.

runs on WebDSL