Boolean-type retractable automata with traps
As in other branches of the algebra, it is a natural idea to find connections between automata and their congruence lattices. For example, describe all automata whose congruence lattices are Boolean algebras. Although this problem will not be solved in this paper, we give a necessary condition for a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
1991
|
| Series: | Acta cybernetica
10 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12493 |
| Summary: | As in other branches of the algebra, it is a natural idea to find connections between automata and their congruence lattices. For example, describe all automata whose congruence lattices are Boolean algebras. Although this problem will not be solved in this paper, we give a necessary condition for automata to be automata whose congruence lattices are Boolean algebras. The main object of this paper is to describe a special class of automata with this (necessary) condition. More precisely, we describe all Boolean-type retractable automata (Definition 4.) with traps. |
|---|---|
| Physical Description: | 53-64 |
| ISSN: | 0324-721X |