Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2022, Number 2, Pages 71–75 (Mi vmumm4465)  
Short notes

Number of labelings of definite automata graphs

R. A. Ishchenko

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (439 kB)
References:
PDF
HTML
Abstract: The issue concerning the number of possible labelings of directed graph's edges such that the resulting automation diagramm corresponds to a graph of a definite automaton is studied in the paper. It is proved that such a labeling is unique for a strongly-connected graph in an alphabet of two elements. In the case of an alphabet with a larger number of elements, the exponential dependence of the maximal number of labelings on the number of vertices is proved.
Key words: definite automata, automation diagramm, transition graph, labelings of automation graph, structure of automation graph.
Received: 28.07.2021
English version:
Moscow University Mathematics Bulletin, 2022, Volume 77, Issue 2, Pages 102–107
DOI: https://doi.org/10.3103/S0027132222020048
Bibliographic databases:
Document Type: Article
UDC: 511
Language: Russian
Citation: R. A. Ishchenko, “Number of labelings of definite automata graphs”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 2, 71–75; Moscow University Mathematics Bulletin, 77:2 (2022), 102–107
Citation in format AMSBIB
\Bibitem{Ish22}
\by R.~A.~Ishchenko
\paper Number of labelings of definite automata graphs
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2022
\issue 2
\pages 71--75
\mathnet{http://mi.mathnet.ru/vmumm4465}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4460002}
\zmath{https://zbmath.org/?q=an:7584509}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2022
\vol 77
\issue 2
\pages 102--107
\crossref{https://doi.org/10.3103/S0027132222020048}
Linking options:
  • https://www.mathnet.ru/eng/vmumm4465
  • https://www.mathnet.ru/eng/vmumm/y2022/i2/p71
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:39
    Full-text PDF :10
    References:21
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024