The Labeling Graphs of Definite Automata

被引：1

作者：

Ishchenko, R. A. ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Fac Mech & Math, Moscow 119991, Russia

来源：

关键词：

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 条

[31] Graphs and Automata Extended abstract
Melichar, Borivoj
[J]. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2013, 2013, : 1 - 6
[32] GRAPHS OF LOGICAL AUTOMATA AND THEIR TRANSFORMATIONS
KUZNETSOV, OP
[J]. AUTOMATION AND REMOTE CONTROL, 1975, 36 (09) : 1517 - 1525
[33] A Criterion for the Decidability of the A-Completeness Problem for Definite Automata
Zhuk, D. N.
[J]. DOKLADY MATHEMATICS, 2011, 84 (01) : 447 - 449
[34] Cardinality of the set of all precomplete classes for definite automata
Zhuk D.N.
[J]. Journal of Mathematical Sciences, 2010, 169 (4) : 430 - 434
[35] Weighted Automata and Logics on Graphs
Droste, Manfred
Dueck, Stefan
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 192 - 204
[36] DECOMPOSITION OF GRAPHS AND FINITE AUTOMATA
MELIKOV, AN
BERSHTEY.LS
KARELIN, VP
[J]. ENGINEERING CYBERNETICS, 1968, (02): : 110 - &
[37] On path hypercompositions in graphs and automata
Massouros, Christos G.
[J]. 1ST MINI CONFERENCE ON EMERGING ENGINEERING APPLICATIONS (MCEEA'15), 2016, 41
[38] ON THE TRANSITION GRAPHS OF AUTOMATA AND GRAMMARS
CAUCAL, D
MONFORT, R
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 484 : 311 - 337
[39] A criterion for the decidability of the A-completeness problem for definite automata
D. N. Zhuk
[J]. Doklady Mathematics, 2011, 84 : 447 - 449
[40] Hypergroups Associated with Graphs and Automata
Massouros, Ch. G.
Massouros, G. G.
[J]. NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS 1 AND 2, 2009, 1168 : 164 - +