The complexity of translating logic to finite automata

被引：0
|
作者：
Reinhardt, K [1 ]
机构：
[1] Univ Tubingen, Wilhelm Schickard Inst Informat, D-7400 Tubingen, Germany
来源：
AUTOMATA, LOGICS, AND INFINITE GAMES: A GUIDE TO CURRENT RESEARCH | 2002年 / 2500卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：231 / 238
页数：8
相关论文
共 50 条
  • [1] Translating Linear Temporal Logic Formulas into Automata
    Zhu Weijun
    Zhou Qinglei
    Zhang Haibin
    CHINA COMMUNICATIONS, 2012, 9 (06) : 100 - 113
  • [2] Complexity of control on finite automata
    Delvenne, Jean-Charles
    Blondel, Vincent D.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (06) : 977 - 986
  • [3] EVOLUTION AND THE COMPLEXITY OF FINITE AUTOMATA
    Kilani, Moez
    INTERNATIONAL GAME THEORY REVIEW, 2007, 9 (04) : 731 - 743
  • [4] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
    STRAUBING, H
    THERIEN, D
    FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233
  • [5] Descriptional complexity of nondeterministic finite automata
    Salomaa, Kai
    Developments in Language Theory, Proceedings, 2007, 4588 : 31 - 35
  • [6] Descriptional and Computational Complexity of Finite Automata
    Holzer, Markus
    Kutrib, Martin
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 23 - 42
  • [7] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
    STRAUBING, H
    THERIEN, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 199 - 233
  • [8] COMPLEXITY OF FINITE, PUSHDOWN, AND STACK AUTOMATA
    HUNT, HB
    MATHEMATICAL SYSTEMS THEORY, 1976, 10 (01): : 33 - 52
  • [9] Complexity and Universality of Iterated Finite Automata
    Zhang, Jiang
    COMPLEX SYSTEMS, 2008, 18 (01): : 145 - 158
  • [10] Transition Function Complexity of Finite Automata
    Valdats, Maris
    BALTIC JOURNAL OF MODERN COMPUTING, 2019, 7 (03): : 342 - 353
12345