Robert McNaughton

SIGACT News, 2004

2001

Semi-Thue Systems with an Inhibitor.

[BibT_eX]

[DOI]

J. Autom. Reason., 2001

2000

Playing Infinite Games in Finite Time.

[BibT_eX]

Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

1999

An Insertion into the Chomsky Hierarchy?

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

The Finiteness of Finitely Presented Monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1997

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

[BibT_eX]

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1995

An Efficient Algorithm for Local Testability Problem of Finite State Automata.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Computing the Order of a Locally Testable Automaton.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

1993

Infinite Games Played on Finite Graphs.

[BibT_eX]

[DOI]

Ann. Pure Appl. Logic, 1993

1991

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

[BibT_eX]

[DOI]

Robert McCloskey

IEEE Trans. Computers, 1991

1990

Some Remarks.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1990

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

[BibT_eX]

[DOI]

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

1989

Introduction to Formal Languages (G. E. Revesz).

[BibT_eX]

[DOI]

SIAM Rev., 1989

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

[BibT_eX]

[DOI]

SIAM Rev., 1989

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

[BibT_eX]

[DOI]

Robert McCloskey

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988

Church-Rosser Thue systems and formal languages.

[BibT_eX]

[DOI]

Friedrich Otto

J. ACM, 1988

1985

The Church-Rosser Property and Special Thue Systems.

[BibT_eX]

[DOI]

Deepak Kapur

Mukkai S. Krishnamoorthy

Theor. Comput. Sci., 1985

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

[BibT_eX]

[DOI]

Deepak Kapur

Mukkai S. Krishnamoorthy

Theor. Comput. Sci., 1985

1984

The Undecidability of the Preperfectness of Thue Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

1976

Regularity-Preserving Relations.

[BibT_eX]

[DOI]

Joel I. Seiferas

Theor. Comput. Sci., 1976

1974

Algebraic Decision Procedures for Local Testability.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1974

1971

A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1969

The loop complexity of regular events.

[BibT_eX]

[DOI]

Inf. Sci., 1969

1968

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

[BibT_eX]

[DOI]

Commun. ACM, 1968

1967

Parenthesis Grammars.

[BibT_eX]

[DOI]

J. ACM, 1967

The Loop Complexity of Pure-Group Events

[BibT_eX]

[DOI]

Inf. Control., 1967

1966

Testing and Generating Infinite Sequences by a Finite Automaton

[BibT_eX]

[DOI]

Inf. Control., October, 1966

1963

Finite automata and badly timed elements

[BibT_eX]

[DOI]

Proceedings of the 4th Annual Symposium on Switching Circuit Theory and Logical Design, 1963

1961

Unate Truth Functions.

[BibT_eX]

[DOI]

IRE Trans. Electron. Comput., 1961

The Theory of Automata, a Survey.

[BibT_eX]

[DOI]

Adv. Comput., 1961

1960

Regular Expressions and State Graphs for Automata.

[BibT_eX]

[DOI]

Hisao Yamada

IRE Trans. Electron. Comput., 1960

1953

Some Formal Relative Consistency Proofs.

[BibT_eX]

[DOI]

J. Symb. Log., 1953

1951

A Theorem About Infinite-Valued Sentential Logic.

[BibT_eX]

[DOI]