Rectangular Algebras as Tree Recognizers

: Steinby Magnus

Publisher: UNIV SZEGED, FAC SCIENCE

: 2015

: Acta Cybernetica

: ACTA CYBERNETICA

: ACTA CYBERN

: 22

: 2

: 499

: 515

: 17

: 0324-721X

DOI: https://doi.org/10.14232/actacyb.22.2.2015.15

We consider finite rectangular algebras of finite type as tree recognizers. The type is represented by a ranked alphabet Sigma. We determine the varieties of finite rectangular Sigma-algebras and show that they form a Boolean lattice in which the atoms are minimal varieties of finite Sigma-algebras consisting of projection algebras. We also describe the corresponding varieties of E-tree languages and compare them with some other varieties studied in the literature. Moreover, we establish the solidity properties of these varieties of finite algebras and tree languages. Rectangular algebras have been previously studied by R. Poschel and M. Reichel (1993), and we make use of some of their results.