Intelligent systems. Theory and applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
Full-text PDF (410 kB) Citations (1)
References:
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.
Document Type: Article
Language: Russian
Citation: I. Yu. Samonenko, “The number of regular languages, recognized by group hyperautomata”, Intelligent systems. Theory and applications, 22:2 (2018), 113–122
Citation in format AMSBIB
\Bibitem{Sam18}
\by I.~Yu.~Samonenko
\paper The number of regular languages, recognized by group hyperautomata
\jour Intelligent systems. Theory and applications
\yr 2018
\vol 22
\issue 2
\pages 113--122
\mathnet{http://mi.mathnet.ru/ista20}
Linking options:
  • https://www.mathnet.ru/eng/ista20
  • https://www.mathnet.ru/eng/ista/v22/i2/p113
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Intelligent systems. Theory and applications
    Statistics & downloads:
    Abstract page:102
    Full-text PDF :34
    References:23
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024