• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

О количестве регулярных языков, представимых в групповых гиперавтоматах

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.