WEAK EQUIVALENCE OF FINITE AUTOMATA

被引：0

|

作者：

PLAKSIN, VA

机构：

来源：

ENGINEERING CYBERNETICS | 1979年 / 17卷 / 06期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：90 / 95

页数：6

相关论文

共 50 条

[1] WEAK EQUIVALENCE OF AUTOMATA
RYSTOV, IK
[J]. CYBERNETICS, 1990, 26 (05): : 737 - 742
[2] The Equivalence Problem for Finite Automata
Henzinger, Thomas A.
Raskin, Jean-Francois
[J]. COMMUNICATIONS OF THE ACM, 2015, 58 (02) : 86 - 86
[3] Weak equivalence of higher-dimensional automata
Kahl, Thomas
[J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (01):
[4] EQUIVALENCE OF INFINITE BEHAVIOR OF FINITE AUTOMATA
ALAIWAN, H
[J]. THEORETICAL COMPUTER SCIENCE, 1984, 31 (03) : 297 - 306
[5] On path equivalence of nondeterministic finite automata
Tzeng, WG
[J]. INFORMATION PROCESSING LETTERS, 1996, 58 (01) : 43 - 46
[6] THE EQUIVALENCE PROBLEM OF MULTITAPE FINITE AUTOMATA
HARJU, T
KARHUMAKI, J
[J]. THEORETICAL COMPUTER SCIENCE, 1991, 78 (02) : 347 - 355
[7] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
SEIDL, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 480 - 492
[8] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
SEIDL, H
[J]. SIAM JOURNAL ON COMPUTING, 1990, 19 (03) : 424 - 437
[9] On weak invertibility of nonlinear finite automata
Wang, Hao
[J]. Jisuanji Xuebao/Chinese Journal of Computers, 20 (11): : 1003 - 1008
[10] Equivalence between Mizumoto Lattice Finite Automata
Wang, Yang
Mo, Zhi-wen
[J]. FUZZY INFORMATION AND ENGINEERING, VOL 1, 2009, 54 : 33 - 37

← 1 2 3 4 5 →