scientific article
From MaRDI portal
Publication:4028905
zbMath0767.68077MaRDI QIDQ4028905
Sam M. Kim, Robert McCloskey, Robert McNaughton
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
deterministic finite automatapolynomial time algorithmstate transition graphlocal testability problem
Related Items (2)
A characterization of constant-time cellular automata computation ⋮ On the bound of the synchronization delay of a local automaton
This page was built for publication:
