AUTOMATA WITH STORAGE ON INFINITE WORDS

被引：0
|
作者：
ENGELFRIET, J
HOOGEBOOM, HJ
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 372卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：289 / 303
页数：15
相关论文
共 50 条
  • [21] Weighted automata and logics for infinite nested words
    Droste, Manfred
    Dueck, Stefan
    INFORMATION AND COMPUTATION, 2017, 253 : 448 - 466
  • [22] Complementation constructions for nondeterministic automata on infinite words
    Kupferman, O
    Vardi, MY
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2005, 3440 : 206 - 221
  • [23] Unambiguous automata on bi-infinite words
    Carton, O
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 308 - 317
  • [24] Quantum -Automata over Infinite Words and Their Relationships
    Bhatia, Amandeep Singh
    Kumar, Ajay
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2019, 58 (03) : 878 - 889
  • [25] Weighted Automata and Weighted Logics on Infinite Words
    Droste, M.
    Rahonis, G.
    RUSSIAN MATHEMATICS, 2010, 54 (01) : 26 - 45
  • [26] MULLER AUTOMATA AND BI-INFINITE WORDS
    BEAUQUIER, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 36 - 43
  • [27] Decidable Problems for Probabilistic Automata on Infinite Words
    Chatterjee, Krishnendu
    Tracol, Mathieu
    2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 185 - 194
  • [28] Weighted Automata and Logics for Infinite Nested Words
    Droste, Manfred
    Dueck, Stefan
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 323 - 334
  • [29] Finding shortest witnesses to the nonemptiness of automata on infinite words
    Kupferman, Orna
    Sheinvald-Faragy, Sarai
    CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS, 2006, 4137 : 492 - 508
  • [30] Quantum Finite State Automata over Infinite Words
    Dzelme-Berzina, Ilze
    UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2010, 6079 : 188 - 188
12345