Boolean-type retractable automata with traps

  A. Nagy

Abstract:

  As in other branches of the algebra, it is a natural idea to find connections between automata and their congruence lattices. For example, describeall 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.

 Gyenizse Pal 1996. Szeptember 4. Szerda 14:17:08 MET DST