INTERROGATIVE COMPLEXITY OF OMEGA-LANGUAGES RECOGNITION

被引：0

|

作者：

ALBERTS, M

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 452卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：152 / 157

页数：6

相关论文

共 50 条

[21] ON OMEGA-LANGUAGES WHOSE SYNTACTIC MONOID IS TRIVIAL
JURGENSEN, H
THIERRIN, G
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1983, 12 (05): : 359 - 365
[22] COMPUTATION TREE LOGIC AND REGULAR OMEGA-LANGUAGES
THOMAS, W
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 : 690 - 713
[23] THEORY OF OMEGA-LANGUAGES .1. CHARACTERIZATIONS OF OMEGA-CONTEXT-FREE LANGUAGES
COHEN, RS
GOLD, AY
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 15 (02) : 169 - 184
[24] On Omega-Languages Defined by Mean-Payoff Conditions
Alur, Rajeev
Degorre, Aldric
Maler, Oded
Weiss, Gera
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2009, 5504 : 333 - +
[25] A NEGATIVE ANSWER TO A QUESTION OF WILKE ON VARIETIES OF OMEGA-LANGUAGES
PIN, JE
INFORMATION PROCESSING LETTERS, 1995, 56 (04) : 197 - 200
[26] CHARACTERIZATIONS OF RATIONAL OMEGA-LANGUAGES BY MEANS OF RIGHT CONGRUENCES
VAN, DL
LESAEC, B
LITOVSKY, I
THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) : 1 - 21
[27] DETERMINISTIC AND NON-AMBIGUOUS RATIONAL OMEGA-LANGUAGES
ARNOLD, A
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 192 : 18 - 27
[28] WHICH FINITE MONOIDS ARE SYNTACTIC MONOIDS OF RATIONAL OMEGA-LANGUAGES
PHAN, TH
LIVOTSKY, I
DO, LV
INFORMATION PROCESSING LETTERS, 1992, 42 (03) : 127 - 132
[29] THE 3 SUBFAMILIES OF RATIONAL OMEGA-LANGUAGES CLOSED UNDER OMEGA-TRANSDUCTION
TIMMERMAN, E
THEORETICAL COMPUTER SCIENCE, 1990, 76 (2-3) : 243 - 250
[30] STAR-FREE OMEGA-LANGUAGES AND 1ST ORDER LOGIC
PIN, JE
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 192 : 56 - 67

← 1 2 3 4 5 →