Sam M. Kim

SIAM J. Comput., 1997

An Algorithm for Identifying Spliced Languages.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 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

1991

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

[BibT_eX]

[DOI]

Robert McCloskey

IEEE Trans. Computers, 1991

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

1986

Designing Systolic Algorithms Using Sequential Machines.

[BibT_eX]

[DOI]

Michael A. Palis

IEEE Trans. Computers, 1986

1985

Fast Parallel Language Recognition by Cellular Automata.

[BibT_eX]

[DOI]

Michael A. Palis

Theor. Comput. Sci., 1985

Sequential Machine Characterizations of Trellis and Cellular Automata and Applications.

[BibT_eX]

[DOI]

Shlomo Moran

SIAM J. Comput., 1985

Some results concerning linear iterative (systolic) arrays.

[BibT_eX]

[DOI]

Michael A. Palis

J. Parallel Distributed Comput., 1985

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's

[BibT_eX]

[DOI]

Louis E. Rosier

Inf. Control., 1985

Some Characterizations of Multihead Finite Automata

[BibT_eX]

[DOI]

Louis E. Rosier

Inf. Control., 1985

1984

Characterizations and Computational Complexity of Systolic Trellis Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

A Characterization of Systolic Binary Tree Automata and Applications.

[BibT_eX]

[DOI]

Acta Informatica, 1984

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.

[BibT_eX]

[DOI]