This article is cited in 1 paper

The number of regular languages, recognized by group hyperautomata

I. Yu. Samonenko

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: A hyperautomatа is a finite automatа whose states are the sets of states of some finite automata. A hyperautomatа is called a group hyperautomatа if the semigroup of the automatа on which it is based is a finite group. In this paper, we study the question of the maximum number of regular languages that can be recognized by group hyperautomata.

Keywords: finite automata, hyperautomata, regular languages, finite groups.