Minimal Deterministic Incomplete Automata
Дата
Авторы
Calude,Elena
Lipponen,Mario
Journal Title
Journal ISSN
Volume Title
Издатель
Journal of Universal Computer Science
Аннотация
Описание
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.
Ключевые слова
Minimality , incomplete automata