Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (ICALP, 1984)

A Characterization of Systolic Binary Tree Automata and Applications. - Oscar H. Ibarra; Sam M. Kim (Acta Informatica, 1984)

Characterizations and Computational Complexity of Systolic Trellis Automata. - Oscar H. Ibarra; Sam M. Kim (Theor. Comput. Sci., 1984)

Some Characterizations of Multihead Finite Automata - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (Inf. Control., 1985)

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (Inf. Control., 1985)

Some results concerning linear iterative (systolic) arrays. - Oscar H. Ibarra; Michael A. Palis; Sam M. Kim (J. Parallel Distributed Comput., 1985)

Sequential Machine Characterizations of Trellis and Cellular Automata and Applications. - Oscar H. Ibarra; Sam M. Kim; Shlomo Moran (SIAM J. Comput., 1985)

Fast Parallel Language Recognition by Cellular Automata. - Oscar H. Ibarra; Michael A. Palis; Sam M. Kim (Theor. Comput. Sci., 1985)

Designing Systolic Algorithms Using Sequential Machines. - Oscar H. Ibarra; Sam M. Kim; Michael A. Palis (IEEE Trans. Computers, 1986)

An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. - Sam M. Kim; Robert McNaughton; Robert McCloskey (Optimal Algorithms, 1989)

A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. - Sam M. Kim; Robert McNaughton; Robert McCloskey (IEEE Trans. Computers, 1991)

Computing the Order of a Locally Testable Automaton. - Sam M. Kim; Robert McNaughton (SIAM J. Comput., 1994)

An Efficient Algorithm for Local Testability Problem of Finite State Automata. - Sam M. Kim; Robert McNaughton (COCOON, 1995)

An Algorithm for Identifying Spliced Languages. - Sam M. Kim (COCOON, 1997)

Computational Modeling for Genetic Splicing Systems. - Sam M. Kim (SIAM J. Comput., 1997)