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, 2020, Volume 24, Issue 4, Pages 75–86 (Mi ista283)  
Part 3. Mathematical models

Estimation of the number of labelings of group automata graphs

R. A. Ishchenko

Lomonosov Moscow State University
Full-text PDF (499 kB)
References:
PDF
HTML
Abstract: If we remove symbols of a state diagram, then we get a directed graph. The inverse operation, when this information is restored, is called graph labeling. This article estimates the number of graph labelings that lead to a group automata.
Keywords: group automata, transition graph, state diagram, permanent, matrix decomposition.
Document Type: Article
Language: Russian
Citation: R. A. Ishchenko, “Estimation of the number of labelings of group automata graphs”, Intelligent systems. Theory and applications, 24:4 (2020), 75–86
Citation in format AMSBIB
\Bibitem{Ish20}
\by R.~A.~Ishchenko
\paper Estimation of the number of labelings of group automata graphs
\jour Intelligent systems. Theory and applications
\yr 2020
\vol 24
\issue 4
\pages 75--86
\mathnet{http://mi.mathnet.ru/ista283}
Linking options:
  • https://www.mathnet.ru/eng/ista283
  • https://www.mathnet.ru/eng/ista/v24/i4/p75
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Intelligent systems. Theory and applications
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024