The following pages link to Sam M. Kim (Q792090):
Displayed 18 items.
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- A characterization of systolic binary tree automata and applications (Q1055191) (← links)
- Fast parallel language recognition by cellular automata (Q1075053) (← links)
- (Q2640351) (redirect page) (← links)
- A characterization of constant-time cellular automata computation (Q2640353) (← links)
- (Q3484371) (← links)
- (Q3685230) (← links)
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (Q3692872) (← links)
- Some characterizations of multihead finite automata (Q3716303) (← links)
- On space and time efficient TM simulations of some restricted classes of PDA's (Q3716304) (← links)
- (Q4028905) (← links)
- (Q4246720) (← links)
- Computing the Order of a Locally Testable Automaton (Q4327417) (← links)
- (Q4364597) (← links)
- Computational Modeling for Genetic Splicing Systems (Q4376176) (← links)
- (Q4730797) (← links)
- A polynomial time algorithm for the local testability problem of deterministic finite automata (Q5375412) (← links)
- An efficient algorithm for local testability problem of finite state automata (Q6085759) (← links)