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 条

[1] WEAK EQUIVALENCE OF FINITE AUTOMATA
PLAKSIN, VA
ENGINEERING CYBERNETICS, 1979, 17 (06): : 90 - 95
[2] Weak equivalence of higher-dimensional automata
Kahl, Thomas
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (01):
[3] 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
[4] On the equivalence of Z-automata
Béal, MP
Lombardy, S
Sakarovitch, J
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 397 - 409
[5] Generalized Statistical Equivalence of Automata
A. S. Barashko
Cybernetics and Systems Analysis, 2000, 36 : 784 - 785
[6] Generalized statistical equivalence of automata
Barashko, AS
CYBERNETICS AND SYSTEMS ANALYSIS, 2000, 36 (05) : 784 - 785
[7] METRIC EQUIVALENCE OF TREE AUTOMATA
GECSEG, F
ACTA SCIENTIARUM MATHEMATICARUM, 1985, 48 (1-4): : 163 - 171
[8] The Equivalence Problem for Finite Automata
Henzinger, Thomas A.
Raskin, Jean-Francois
COMMUNICATIONS OF THE ACM, 2015, 58 (02) : 86 - 86
[9] Exact performance equivalence: An equivalence relation for stochastic automata
Buchholz, P
THEORETICAL COMPUTER SCIENCE, 1999, 215 (1-2) : 263 - 287
[10] Generalized statistical equivalence of automata
Barashko, A.S.
Kibernetika i Sistemnyj Analiz, 2000, (05): : 176 - 179

← 1 2 3 4 5 →