Categories and Subject Descriptors: F.1.1 [Computation by Abstract Devices]: Models of Computation -- automata, relations between models
General Terms: Neural nets, Finite automata
Additional Key Words and Phrases: Mealy Machines
Selected papers that cite this one
- Christian W. Omlin and C. Lee Giles. Constructing deterministic finite-state automata in recurrent neural networks. Journal of the ACM, 43(6):937-972, November 1996.
- Pekka Orponen. Neural networks and complexity theory. Nordic Journal of Computing, 1(1):94-110, Spring 1994.
- Hava T. Siegelmann and Eduardo D. Sontag. On the computational power of neural nets. Journal of Computer and System Sciences, 50(1):132-150, February 1995.
- Ji\v{r}í \v{S}íma and Ji\v{r}í Wiedermann. Theory of neuromata. Journal of the ACM, 45(1):155-178, January 1998.