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 条
  • [21] Realizability of Parity Logic in Finite Cellular Automata
    Lawrence, Celestine P.
    COMPLEX SYSTEMS, 2024, 33 (01): : 125 - 132
  • [22] Continuous logic in problems of finite automata dynamics
    Levin, V. I.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2010, 49 (01) : 59 - 64
  • [23] On the Descriptional Complexity of the Direct Product of Finite Automata
    Holzer, Markus
    Rauch, Christian
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022, 2022, 13439 : 100 - 111
  • [24] On the complexity of analysis of automata over a finite ring
    V. V. Skobelev
    V. G. Skobelev
    Cybernetics and Systems Analysis, 2010, 46 (4) : 533 - 545
  • [25] State Complexity of Partial Word Finite Automata
    Kutrib, Martin
    Wendlandt, Matthias
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 113 - 124
  • [26] THE COMPLEXITY OF CONCATENATION ON DETERMINISTIC AND ALTERNATING FINITE AUTOMATA
    Hospodar, Michal
    Jiraskova, Galina
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2018, 52 (2-4): : 153 - 168
  • [27] The Complexity of Compressed Membership Problems for Finite Automata
    Jez, Artur
    THEORY OF COMPUTING SYSTEMS, 2014, 55 (04) : 685 - 718
  • [28] State complexity of additive weighted finite automata
    Salomaa, Kai
    Schofield, Paul
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (06) : 1407 - 1416
  • [29] The complexity of probabilistic versus quantum finite automata
    Midrijanis, G
    SOFSEM 2002: THEORY AND PRACTICE OF INFORMATICS, 2002, 2540 : 273 - 278
  • [30] Characterization and complexity results on jumping finite automata
    Fernau, Henning
    Paramasivan, Meenakshi
    Schmid, Markus L.
    Vorel, Vojtech
    THEORETICAL COMPUTER SCIENCE, 2017, 679 : 31 - 52
12345