WEAK EQUIVALENCE OF FINITE AUTOMATA

被引：0

|

作者：

PLAKSIN, VA

机构：

来源：

ENGINEERING CYBERNETICS | 1979年 / 17卷 / 06期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：90 / 95

页数：6

相关论文

共 50 条

[31] APPLICATION OF EQUIVALENCE RELATIONS TO THE DESCRIPTION OF EVENTS REPRESENTABLE BY FINITE AUTOMATA
RUDNEV VV
TAL AA
1970, (03): : 96 - 101
[32] THE EQUIVALENCE PROBLEM FOR N-TAPE FINITE AUTOMATA WITH SIMPLE CYCLES
CULIK, K
LINNA, M
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 15 - 25
[33] Revisiting the Power and Equivalence of One-Way Quantum Finite Automata
Li, Lvzhou
Qiu, Daowen
ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2010, 6216 : 1 - 8
[34] Efficient algorithm for checking multiplicity equivalence for the finite Z-Σ*-automata
Archangelsky, K
DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 283 - 289
[35] APPLICATION OF LANGUAGE OF EQUIVALENCE TRANSFORMATIONS TO DESCRIBE FINITE-AUTOMATA SETS
RUDNEV, VV
TAL, AA
AUTOMATION AND REMOTE CONTROL, 1971, 32 (09) : 1426 - &
[36] EQUATIONS OVER FINITE SETS OF WORDS AND EQUIVALENCE PROBLEMS IN AUTOMATA THEORY
KARHUMAKI, J
THEORETICAL COMPUTER SCIENCE, 1993, 108 (01) : 103 - 118
[37] On the Structure of Finite Automata of Which M'Is an(Weak)Inverse with Delay τ
陈世华
Journal of Computer Science & Technology, 1986, (02) : 54 - 59
[38] WEAK EQUIVALENCE OF LINEAR-SYSTEMS AND FINITE STATE SYSTEMS
MULLIS, CT
ROBERTS, RA
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 1979, 10 (03) : 498 - 511
[39] Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Qiu, Daowen
Li, Lvzhou
Zou, Xiangfu
Mateus, Paulo
Gruska, Jozef
ACTA INFORMATICA, 2011, 48 (5-6) : 271 - 290
[40] Nondeterministic finite automata based on quantum logic: Language equivalence relation and robustness
Wang, Haihui
Zhao, Luyao
Li, Ping
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2021, 129 : 20 - 40

← 1 2 3 4 5 →