STRUCTURAL PRESERVING MORPHISMS OF FINITE AUTOMATA AND AN APPLICATION TO GRAPH ISOMORPHISM

被引：0

作者：

YANG, CC ^{[1
]}

机构：

[1] UNIV ALABAMA,DEPT INFORMATION SCI,UNIV STN,BIRMINGHAM,AL 35294

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1975年 / 24卷 / 11期

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：1133 / 1139

页数：7

共 50 条

[1] ISOMORPHISM OF GRAPHS AND FINITE AUTOMATA
MELIKHOV, AN
BERSHTEY.LS
KARELIN, VP
ENGINEERING CYBERNETICS, 1968, (01): : 124 - &
[2] A learning automata based graph isomorphism algorithm
Beigy, H
Meybodi, MR
PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 344 - 348
[3] FINITE AUTOMATA AND MORPHISMS IN ASSISTED MUSICAL COMPOSITION
ALLOUCHE, JP
JOHNSON, T
JOURNAL OF NEW MUSIC RESEARCH, 1995, 24 (02) : 97 - 108
[4] CELLULAR GRAPH AUTOMATA .2. GRAPH AND SUBGRAPH ISOMORPHISM, GRAPH STRUCTURE RECOGNITION
WU, A
ROSENFELD, A
INFORMATION AND CONTROL, 1979, 42 (03): : 330 - 353
[5] Privacy preserving subgraph isomorphism query for dynamic graph database
Cong, Linhao
Yu, Jia
Ge, Xinrui
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2023, 211
[6] Finite graph automata for linear and boundary graph languages
Brandenburg, FJ
Skodinis, K
THEORETICAL COMPUTER SCIENCE, 2005, 332 (1-3) : 199 - 232
[7] Logical and Structural Approaches to the Graph Isomorphism Problem
Grohe, Martin
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 42 - 42
[8] ISOMORPHISM TESTING FOR GRAPHS, SEMIGROUPS, AND FINITE AUTOMATA ARE POLYNOMIALLY EQUIVALENT PROBLEMS
BOOTH, KS
SIAM JOURNAL ON COMPUTING, 1978, 7 (03) : 273 - 279
[9] REPRESENTATION OF LINEAR AUTOMATA BY THE FINITE WEIGHTED GRAPH
GABBASOV, NZ
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1985, (07): : 68 - 70
[10] Checking π-Calculus Structural Congruence is Graph Isomorphism Complete
Khomenko, Victor
Meyer, Roland
NINTH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2009, : 70 - +

← 1 2 3 4 5 →