AN INTRODUCTION TO FINITE AUTOMATA ON INFINITE WORDS

被引：0
|
作者：
PERRIN, D
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 192卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：2 / 17
页数：16
相关论文
共 50 条
  • [31] Weighted Automata and Logics for Infinite Nested Words
    Droste, Manfred
    Dueck, Stefan
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 323 - 334
  • [32] Infinite words with finite defect
    Balkova, L'ubomira
    Pelantova, Edita
    Starosta, Stepan
    ADVANCES IN APPLIED MATHEMATICS, 2011, 47 (03) : 562 - 574
  • [33] Finite acceptance of infinite words
    Litovsky, I
    Staiger, L
    THEORETICAL COMPUTER SCIENCE, 1997, 174 (1-2) : 1 - 21
  • [34] Combinatorics of Finite Words and Suffix Automata
    Fici, Gabriele
    ALGEBRAIC INFORMATICS, 2009, 5725 : 250 - 259
  • [35] Finite automata and pattern avoidance in words
    Brändén, A
    Mansour, T
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2005, 110 (01) : 127 - 145
  • [36] Finite Automata with Sets of Translucent Words
    Nagy, Benedek
    Otto, Friedrich
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2024, 2024, 14791 : 236 - 251
  • [37] EQUIVALENCE OF INFINITE BEHAVIOR OF FINITE AUTOMATA
    ALAIWAN, H
    THEORETICAL COMPUTER SCIENCE, 1984, 31 (03) : 297 - 306
  • [38] CONTROL OF INFINITE BEHAVIOR OF FINITE AUTOMATA
    THISTLE, JG
    WONHAM, WM
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1994, 32 (04) : 1075 - 1097
  • [39] 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
  • [40] Automata and logics for words and trees over an infinite alphabet
    Segoufin, Luc
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2006, 4207 : 41 - 57
12345