Nagy Attila: Boolean-type retractable automata with traps. In: Acta cybernetica, (10) 1-2. pp. 53-64. (1991)
Preview |
Cikk, tanulmány, mű
cybernetica_010_numb_001_002_053-064.pdf Download (832kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1991 |
| Volume: | 10 |
| Number: | 1-2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 53-64 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38493/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika, Automaták |
| Additional Information: | Bibliogr.: p. 63-64. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 08:25 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12493 |
Actions (login required)
 |
View Item |
