AN INTRODUCTION TO FINITE AUTOMATA ON INFINITE WORDS

被引：0

作者：

PERRIN, D

机构：

来源：

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：2 / 17

页数：16

共 50 条

[1] Quantum Finite State Automata over Infinite Words
Dzelme-Berzina, Ilze
UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2010, 6079 : 188 - 188
[2] AUTOMATA ON INFINITE WORDS
PERRIN, D
INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS, 1994, 51 : 491 - 492
[3] Minimizing automata on infinite words
Wilke, T
LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2003, 2850 : 289 - 289
[4] Prediction of Infinite Words with Automata
Smith, Tim
COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2016, 2016, 9691 : 394 - 408
[5] AUTOMATA ON INFINITE WORDS - PREFACE
PERRIN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 192 : R3 - R4
[6] Prediction of Infinite Words with Automata
Tim Smith
Theory of Computing Systems, 2018, 62 : 653 - 681
[7] AUTOMATA WITH STORAGE ON INFINITE WORDS
ENGELFRIET, J
HOOGEBOOM, HJ
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 289 - 303
[8] BOUSTROPHEDON AUTOMATA ON INFINITE WORDS
PECUCHET, JP
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 192 : 47 - 54
[9] Prediction of Infinite Words with Automata
Smith, Tim
THEORY OF COMPUTING SYSTEMS, 2018, 62 (03) : 653 - 681
[10] Deciding FO2 Alternation for Automata over Finite and Infinite Words
Henriksson, Viktor
Kufleitner, Manfred
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 180 - 191