THE PARALLEL COMPLEXITY OF FINITE-STATE AUTOMATA PROBLEMS

被引：0

|

作者：

SANG, C

HUYNH, DT

机构：

来源：

INFORMATION AND COMPUTATION | 1992年 / 97卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：1 / 22

页数：22

相关论文

共 50 条

[1] PARALLEL DECISION PROCEDURES FOR FINITE-STATE AUTOMATA
GOLDBERG, RR
WAXMAN, J
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 49 (1-2) : 33 - 40
[2] An Efficient Parallel Determinisation Algorithm for Finite-state Automata
Hanneforth, Thomas
Watson, Bruce W.
[J]. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 42 - 52
[3] Smaller representations for finite-state transducers and finite-state automata
Roche, E
[J]. COMBINATORIAL PATTERN MATCHING, 1995, 937 : 352 - 365
[4] Rough finite-state automata
Basu, S
[J]. CYBERNETICS AND SYSTEMS, 2005, 36 (02) : 107 - 124
[5] The parameterized complexity of intersection and composition operations on sets of finite-state automata
Wareham, HT
[J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2001, 2088 : 302 - 310
[6] FINITE-STATE AUTOMATA IN INFORMATION TECHNOLOGIES
Kryvyi, S. L.
[J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2011, 47 (05) : 669 - 683
[7] Deterministic chaotic finite-state automata
Moatsum Alawida
Azman Samsudin
Je Sen Teh
Wafa’ Hamdan Alshoura
[J]. Nonlinear Dynamics, 2019, 98 : 2403 - 2421
[8] FUNCTIONAL EQUIVALENCE OF FINITE-STATE AUTOMATA
LETICHEV.AA
[J]. DOKLADY AKADEMII NAUK SSSR, 1969, 185 (01): : 58 - &
[9] FORMALIZATION OF SYNTHESIS OF FINITE-STATE AUTOMATA
VOROBYEV, SA
[J]. TELECOMMUNICATIONS AND RADIO ENGINEERING, 1990, 45 (10) : 22 - 32
[10] Deterministic chaotic finite-state automata
Alawida, Moatsum
Samsudin, Azman
Teh, Je Sen
Alshoura, Wafa' Hamdan
[J]. NONLINEAR DYNAMICS, 2019, 98 (03) : 2403 - 2421

← 1 2 3 4 5 →