On Syntactic Congruences for Omega-Languages and the Minimization of Omega-Automata

被引：0
|
作者：
Maler, O.
Staiger, L.
机构：
来源：
Bulletin of the European Association for Theoretical Computer Science | 1994年 / 53期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] On syntactic congruences for omega-languages
    Maler, O
    Staiger, L
    THEORETICAL COMPUTER SCIENCE, 1997, 183 (01) : 93 - 112
  • [2] A SYNTACTIC CONGRUENCE FOR RATIONAL OMEGA-LANGUAGES
    ARNOLD, A
    THEORETICAL COMPUTER SCIENCE, 1985, 39 (2-3) : 333 - 335
  • [3] ACCEPTING CONDITIONS FOR AUTOMATA ON OMEGA-LANGUAGES
    MORIYA, T
    YAMASAKI, H
    THEORETICAL COMPUTER SCIENCE, 1988, 61 (2-3) : 137 - 147
  • [4] ON OMEGA-LANGUAGES WHOSE SYNTACTIC MONOID IS TRIVIAL
    JURGENSEN, H
    THIERRIN, G
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1983, 12 (05): : 359 - 365
  • [5] CHARACTERIZATIONS OF RATIONAL OMEGA-LANGUAGES BY MEANS OF RIGHT CONGRUENCES
    VAN, DL
    LESAEC, B
    LITOVSKY, I
    THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) : 1 - 21
  • [6] INFINITARY TREE-LANGUAGES RECOGNIZED BY OMEGA-AUTOMATA
    SAOUDI, A
    INFORMATION PROCESSING LETTERS, 1984, 18 (01) : 15 - 19
  • [7] ON ALTERNATING OMEGA-AUTOMATA
    LINDSAY, PA
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 36 (01) : 16 - 24
  • [8] CONTROL OF OMEGA-AUTOMATA, CHURCHS PROBLEM, AND THE EMPTINESS PROBLEM FOR TREE OMEGA-AUTOMATA
    THISTLE, JG
    WONHAM, WM
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 367 - 381
  • [9] WHICH FINITE MONOIDS ARE SYNTACTIC MONOIDS OF RATIONAL OMEGA-LANGUAGES
    PHAN, TH
    LIVOTSKY, I
    DO, LV
    INFORMATION PROCESSING LETTERS, 1992, 42 (03) : 127 - 132
  • [10] The Hanoi Omega-Automata Format
    Babiak, Tomas
    Blahoudek, Frantisek
    Duret-Lutz, Alexandre
    Klein, Joachim
    Kretinsky, Jan
    Mueller, David
    Parker, David
    Strejcek, Jan
    COMPUTER AIDED VERIFICATION, PT I, 2015, 9206 : 479 - 486
12345