WEAK EQUIVALENCE OF FINITE AUTOMATA

被引：0

|

作者：

PLAKSIN, VA

机构：

来源：

ENGINEERING CYBERNETICS | 1979年 / 17卷 / 06期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：90 / 95

页数：6

相关论文

共 50 条

[41] Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Daowen Qiu
Lvzhou Li
Xiangfu Zou
Paulo Mateus
Jozef Gruska
Acta Informatica, 2011, 48
[42] ON THE EQUIVALENCE AND CONTAINMENT PROBLEMS FOR UNAMBIGUOUS REGULAR EXPRESSIONS, REGULAR GRAMMARS AND FINITE AUTOMATA
STEARNS, RE
HUNT, HB
SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 598 - 611
[43] Nondeterministic finite automata based on quantum logic: Language equivalence relation and robustness
Li, Ping (liping@snnu.edu.cn), 1600, Elsevier Inc. (129):
[44] Weak alternating automata are not that weak
Kupferman, O
Vardi, MY
PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, : 147 - 158
[45] Weak invertibility of linear finite automata over rings——Classification and enumeration
戴宗铎
叶顶锋
Science Bulletin, 1996, (03) : 190 - 196
[46] Weak invertibility of linear finite automata over rings - Classification and enumeration
Dai, ZD
Ye, DF
CHINESE SCIENCE BULLETIN, 1996, 41 (03): : 190 - 196
[47] AUTOMATA AND FINITE AUTOMATA
LEE, CY
BELL SYSTEM TECHNICAL JOURNAL, 1960, 39 (05): : 1267 - 1295
[48] Polynomial-time algorithms for the equivalence for one-way quantum finite automata
Koshiba, T
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 268 - 278
[49] On the equivalence of Z-automata
Béal, MP
Lombardy, S
Sakarovitch, J
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 397 - 409
[50] Generalized statistical equivalence of automata
Barashko, AS
CYBERNETICS AND SYSTEMS ANALYSIS, 2000, 36 (05) : 784 - 785

← 1 2 3 4 5 →