SAFE EXECUTIONS OF RECOGNIZABLE TRACE LANGUAGES BY ASYNCHRONOUS AUTOMATA

被引：0

|

作者：

ZIELONKA, W

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 363卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：278 / 289

页数：12

相关论文

共 50 条

[11] Weighted Languages Recognizable by Weighted Tree Automata
Fulop, Zoltan
Gazdag, Zsolt
ACTA CYBERNETICA, 2018, 23 (03): : 867 - 886
[12] Recognizable Languages of k-Forcing Automata
Shamsizadeh, Marzieh
Zahedi, Mohammad Mehdi
Abolpour, Khadijeh
De la sen, Manuel
MATHEMATICAL AND COMPUTATIONAL APPLICATIONS, 2024, 29 (03)
[13] RATIONAL AND RECOGNIZABLE COMPLEX TRACE LANGUAGES
DIEKERT, V
GASTIN, P
PETIT, A
INFORMATION AND COMPUTATION, 1995, 116 (01) : 134 - 153
[14] ASYNCHRONOUS AUTOMATA AND LOGIC LANGUAGES
GLEBSKII, YV
GORDON, EI
AUTOMATION AND REMOTE CONTROL, 1974, 35 (10) : 1677 - 1682
[15] ON THE EXISTENCE OF MINIMUM ASYNCHRONOUS AUTOMATA AND ON THE EQUIVALENCE PROBLEM FOR UNAMBIGUOUS REGULAR TRACE LANGUAGES
BRUSCHI, D
PIGHIZZINI, G
SABADINI, N
INFORMATION AND COMPUTATION, 1994, 108 (02) : 262 - 285
[16] ASYNCHRONOUS AUTOMATA WITH DELAYS, AND LOGICAL LANGUAGES
GLEBSKII, YV
GORDON, EI
AUTOMATION AND REMOTE CONTROL, 1974, 35 (12) : 2002 - 2007
[17] ASYNCHRONOUS TRACE-MATCHING AUTOMATA
Shahbazyanat, K. V.
Shoukouriana, Vu. H., I
CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (03) : 323 - 329
[18] Languages not recognizable in real time by one-dimensional cellular automata
Nakamura, Katsuhiko
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (07) : 1095 - 1102
[19] On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Golovkins, Marats
Kravtsev, Maksim
Kravcevs, Vasilijs
THEORETICAL COMPUTER SCIENCE, 2009, 410 (20) : 1942 - 1951
[20] PROJECTIONS OF LANGUAGES RECOGNIZABLE BY PROBABILISTIC AND ALTERNATING FINITE MULTI-TAPE AUTOMATA
FREIVALDS, R
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 195 - 198

← 1 2 3 4 5 →