The Labeling Graphs of Definite Automata

被引：1
|
作者：
Ishchenko, R. A. [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Fac Mech & Math, Moscow 119991, Russia
来源：
MOSCOW UNIVERSITY MATHEMATICS BULLETIN | 2019年 / 74卷 / 05期
关键词：
D O I：
10.3103/S002713221905005X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Au algorithm of labeling a directed graph so that the obtained transition graph represents a definite automaton is described.
引用
收藏
页码：198 / 201
页数：4
相关论文
共 50 条
  • [41] ISOMORPHISM OF GRAPHS AND FINITE AUTOMATA
    MELIKHOV, AN
    BERSHTEY.LS
    KARELIN, VP
    [J]. ENGINEERING CYBERNETICS, 1968, (01): : 124 - &
  • [42] RELAXATION LABELING WITH LEARNING AUTOMATA.
    Thathachar, Mandayam A.L.
    Sastry, P.S.
    [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986, PAMI-8 (02) : 256 - 268
  • [43] Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
    Bondar, Eugenija A. A.
    Casas, David
    Volkov, Mikhail V. V.
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2023, 34 (06) : 655 - 690
  • [44] Critical graphs for the positive definite completion problem
    Barrett, WW
    Johnson, CR
    Loewy, R
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1998, 20 (01) : 117 - 130
  • [45] Antimagic Labeling of Cubic Graphs
    Liang, Yu-Chang
    Zhu, Xuding
    [J]. JOURNAL OF GRAPH THEORY, 2014, 75 (01) : 31 - 36
  • [46] Coloring and labeling problems on graphs
    University of Illinois at Urbana-Champaign
    [J]. 1600,
  • [47] Informative labeling schemes for graphs
    Peleg, D
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 340 (03) : 577 - 593
  • [48] LABELING ANGLES OF PLANAR GRAPHS
    LOUPEKINE, F
    WATKINS, JJ
    [J]. DISCRETE MATHEMATICS, 1988, 72 (1-3) : 251 - 256
  • [49] On the α-labeling number of bipartite graphs
    El-Zanati, S
    Fu, HL
    Shiue, CL
    [J]. DISCRETE MATHEMATICS, 2000, 214 (1-3) : 241 - 243
  • [50] Labeling of Chain Bipartite Graphs
    Sathiamoorthy, G.
    [J]. NATIONAL ACADEMY SCIENCE LETTERS-INDIA, 2020, 43 (07): : 639 - 641
12345