|
Intelligent systems. Theory and applications, 2018, Volume 22, Issue 2, Pages 113–122
(Mi ista20)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Citation:
I. Yu. Samonenko, “The number of regular languages, recognized by group hyperautomata”, Intelligent systems. Theory and applications, 22:2 (2018), 113–122
Linking options:
https://www.mathnet.ru/eng/ista20 https://www.mathnet.ru/eng/ista/v22/i2/p113
|
Statistics & downloads: |
Abstract page: | 102 | Full-text PDF : | 34 | References: | 23 |
|