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 条

[21] Weighted automata and weighted logics on infinite words
Droste, Manfred
Rahonis, George
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 49 - 58
[22] CO-DETERMINISTIC AUTOMATA ON INFINITE WORDS
BEAUQUIER, D
PERRIN, D
INFORMATION PROCESSING LETTERS, 1985, 20 (02) : 95 - 98
[23] Quantum ω-Automata over Infinite Words and Their Relationships
Amandeep Singh Bhatia
Ajay Kumar
International Journal of Theoretical Physics, 2019, 58 : 878 - 889
[24] Weighted automata and logics for infinite nested words
Droste, Manfred
Dueck, Stefan
INFORMATION AND COMPUTATION, 2017, 253 : 448 - 466
[25] 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
[26] Unambiguous automata on bi-infinite words
Carton, O
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 308 - 317
[27] Weighted Automata and Weighted Logics on Infinite Words
Droste, M.
Rahonis, G.
RUSSIAN MATHEMATICS, 2010, 54 (01) : 26 - 45
[28] Quantum -Automata over Infinite Words and Their Relationships
Bhatia, Amandeep Singh
Kumar, Ajay
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2019, 58 (03) : 878 - 889
[29] 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
[30] MULLER AUTOMATA AND BI-INFINITE WORDS
BEAUQUIER, D
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 36 - 43

← 1 2 3 4 5 →