JUCS - Journal of Universal Computer Science 3(11): 1180-1193, doi: 10.3217/jucs-003-11-1180
Minimal Deterministic Incomplete Automata
expand article infoElena Calude‡, Mario Lipponen‡
‡ Computer Science Department, The University of Auckland, Auckland, New Zealand

Corresponding author: Elena Calude ( elena@cs.auckland.ac.nz )

© Elena Calude, Mario Lipponen.
This article is freely available under the J.UCS Open Content License.
Citation: Calude E, Lipponen M (1997) Minimal Deterministic Incomplete Automata. JUCS - Journal of Universal Computer Science 3(11): 1180-1193. https://doi.org/10.3217/jucs-003-11-1180
Open Access
Abstract
We construct a minimal automaton for an output-incomplete Moore automaton. The approach is motivated by physical interpretation of seeing deterministic finite automata as models for elementary particles. When compared to some classical methods our minimal automaton is unique up to an isomorphism and preserves also the undefined or unspecified behaviour of the original automaton. 1.) Proceedings of the First Japan--New Zealand Workshop on Logic in Computer Science, special issue editors D.S. Bridges, C.S. Calude, M.J. Dinneen and B. Khoussainov. 2.)On leave from the Department of Mathematics, University of Turku, Finland.
Keywords
Minimality, incomplete automata