ON COMPLEXITY OF UNDECIDABLE PROBLEMS IN AUTOMATA THEORY

被引：3

作者：

HARTMANIS, J

机构：

来源：

JOURNAL OF THE ACM | 1969年 / 16卷 / 01期

关键词：

D O I：

10.1145/321495.321507

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：160 / +

页数：1

共 50 条

[1] Undecidable problems about timed automata
Finkel, Olivier
[J]. FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2006, 4202 : 187 - 199
[2] Generic complexity of undecidable problems
Myasnikov, Alexei
[J]. Computer Science - Theory and Applications, 2007, 4649 : 407 - 417
[3] Generic complexity of undecidable problems
Myasnikov, Alexei G.
Rybalov, Alexander N.
[J]. JOURNAL OF SYMBOLIC LOGIC, 2008, 73 (02) : 656 - 673
[4] OPEN PROBLEMS IN AUTOMATA THEORY RELATED TO COMPLEXITY THEORY
CHROBAK, M
HROMKOVIC, J
[J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1986, 5 (06): : 489 - 492
[5] COMPLEXITY OF SOME PROBLEMS FROM THE THEORY OF AUTOMATA
STERN, J
[J]. INFORMATION AND CONTROL, 1985, 66 (03): : 163 - 176
[6] Decidable and undecidable problems about quantum automata
Blondel, VD
Jeandel, E
Koiran, P
Portier, N
[J]. SIAM JOURNAL ON COMPUTING, 2005, 34 (06) : 1464 - 1473
[7] Undecidable Problems for Probabilistic Automata of Fixed Dimension
[J]. Theory of Computing Systems, 2003, 36 : 231 - 245
[8] Undecidable problems for probabilistic automata of fixed dimension
Blondel, VD
Canterini, V
[J]. THEORY OF COMPUTING SYSTEMS, 2003, 36 (03) : 231 - 245
[9] Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Gimbert, Hugo
Oualhadj, Youssouf
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 527 - +
[10] Some undecidable problems for parallel communicating finite automata systems
Martín-Vide, C
Mitrana, V
[J]. INFORMATION PROCESSING LETTERS, 2001, 77 (5-6) : 239 - 245

← 1 2 3 4 5 →