WEAK EQUIVALENCE OF AUTOMATA

被引：0

作者：

RYSTOV, IK

机构：

来源：

CYBERNETICS | 1990年 / 26卷 / 05期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

A generalization of Moore's theorem of weak equivalence of automata is derived. The weak equivalence problem and the existence problems of homing and diagnosing input-output sequences in an automaton are shown to be polynomially complete.

引用

页码：737 / 742

页数：6

共 50 条

[21] On path equivalence of nondeterministic finite automata
Tzeng, WG
INFORMATION PROCESSING LETTERS, 1996, 58 (01) : 43 - 46
[22] THE EQUIVALENCE PROBLEM OF MULTITAPE FINITE AUTOMATA
HARJU, T
KARHUMAKI, J
THEORETICAL COMPUTER SCIENCE, 1991, 78 (02) : 347 - 355
[23] ON THE EQUIVALENCE PROBLEM OF STATES FOR CELLULAR AUTOMATA
BOLOTOV, AA
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 53 - 54
[24] Language equivalence of probabilistic pushdown automata
Forejt, Vojtech
Jancar, Petr
Kiefer, Stefan
Worrell, James
INFORMATION AND COMPUTATION, 2014, 237 : 1 - 11
[25] WEAK SPECTRAL EQUIVALENCE AND WEAK SPECTRAL CONVERGENCE
DINESCU, G
CZECHOSLOVAK MATHEMATICAL JOURNAL, 1984, 34 (02) : 203 - 226
[26] EQUIVALENCE OF DETERMINISTIC PUSHDOWN AUTOMATA REVISITED
Meitus, V. Yu.
CYBERNETICS AND SYSTEMS ANALYSIS, 2007, 43 (02) : 179 - 191
[27] Equivalence of Deterministic and Nondeterministic Epsilon Automata
Trybulec, Michal
FORMALIZED MATHEMATICS, 2009, 17 (02): : 193 - 199
[28] ACME: Automata with Counters, Monoids and Equivalence
Fijalkow, Nathanael
Kuperberg, Denis
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2014, 2014, 8837 : 163 - 167
[29] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
SEIDL, H
SIAM JOURNAL ON COMPUTING, 1990, 19 (03) : 424 - 437
[30] THE EQUIVALENCE AND LEARNING OF PROBABILISTIC-AUTOMATA
TZENG, WG
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 268 - 273

← 1 2 3 4 5 →