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 条
  • [31] The Complexity of Compressed Membership Problems for Finite Automata
    Artur Jeż
    Theory of Computing Systems, 2014, 55 : 685 - 718
  • [32] State complexity of unambiguous operations on finite automata
    Jiraskova, Galina
    Okhotin, Alexander
    THEORETICAL COMPUTER SCIENCE, 2019, 798 : 52 - 64
  • [33] The complexity of probabilistic versus deterministic finite automata
    Ambainis, A
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 233 - 238
  • [34] Complexity of Unary Exclusive Nondeterministic Finite Automata
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
  • [35] Complexity Analysis: Transformation Monoids of Finite Automata
    Brandl, Christian
    Simon, Hans Ulrich
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 143 - 154
  • [36] More on the Descriptional Complexity of Products of Finite Automata
    Holzer, Markus
    Rauch, Christian
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [37] Computational complexity of finite asynchronous cellular automata
    Dennunzio, Alberto
    Formenti, Enrico
    Manzoni, Luca
    Mauri, Giancarlo
    Porreca, Antonio E.
    THEORETICAL COMPUTER SCIENCE, 2017, 664 : 131 - 143
  • [38] Mathematical logic and quantum finite state automata
    Dzelme-Berzina, Ilze
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (20) : 1952 - 1959
  • [39] Translating regular expressions into small ε-free nondeterministic finite automata
    Hromkovic, J
    Seibert, S
    Wilke, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (04) : 565 - 588
  • [40] Translating regular expressions into small ε-free nondeterministic finite automata
    Hromkovic, J
    Seibert, S
    Wilke, T
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 55 - 66
12345