Sam M. Kim

Available identifiers

Publication	Date of Publication	Type
An efficient algorithm for local testability problem of finite state automata	2023-12-12	Paper
Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes	2022-07-01	Paper
A polynomial time algorithm for the local testability problem of deterministic finite automata	2018-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4246720	1999-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q4364597	1998-06-03	Paper
Computational Modeling for Genetic Splicing Systems	1998-02-10	Paper
Computing the Order of a Locally Testable Automaton	1995-04-06	Paper
https://portal.mardi4nfdi.de/entity/Q4028905	1993-03-28	Paper
A characterization of constant-time cellular automata computation	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3484371	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4730797	1986-01-01	Paper
Fast parallel language recognition by cellular automata	1985-01-01	Paper
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications	1985-01-01	Paper
Some characterizations of multihead finite automata	1985-01-01	Paper
On space and time efficient TM simulations of some restricted classes of PDA's	1985-01-01	Paper
Characterizations and computational complexity of systolic trellis automata	1984-01-01	Paper
A characterization of systolic binary tree automata and applications	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3685230	1984-01-01	Paper

This page was built for person: Sam M. Kim