Generalized Nondeterminism and the Succint Representation of Regular Languages

被引：0
|
作者：
机构：
来源：
Bull Eur Assoc Theor Comput Sci | / 62卷 / 349期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] ON MEASURING NONDETERMINISM IN REGULAR LANGUAGES
    GOLDSTINE, J
    KINTALA, CMR
    WOTSCHKE, D
    INFORMATION AND COMPUTATION, 1990, 86 (02) : 179 - 194
  • [2] REPRESENTATION THEOREMS ON REGULAR LANGUAGES
    HASHIGUCHI, K
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 27 (01) : 101 - 115
  • [3] REPRESENTATION OF REGULAR LANGUAGES BY EQUALITY SETS
    Halava, Vesa
    Harju, Tero
    Latteux, Michel
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (86): : 224 - 228
  • [4] NONDETERMINISM IN FUNCTIONAL LANGUAGES
    SONDERGAARD, H
    SESTOFT, P
    COMPUTER JOURNAL, 1992, 35 (05): : 514 - 523
  • [5] REGULAR LANGUAGES DEFINED WITH GENERALIZED QUANTIFIERS
    STRAUBING, H
    THERIEN, D
    THOMAS, W
    INFORMATION AND COMPUTATION, 1995, 118 (02) : 289 - 301
  • [6] REGULAR LANGUAGES DEFINED WITH GENERALIZED QUANTIFIERS
    STRAUBING, H
    THERIEN, D
    THOMAS, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 561 - 575
  • [7] More concise representation of regular languages by automata and regular expressions
    Geffert, Viliam
    Mereghetti, Carlo
    Palano, Beatrice
    INFORMATION AND COMPUTATION, 2010, 208 (04) : 385 - 394
  • [8] More Concise Representation of Regular Languages by Automata and Regular Expressions
    Geffert, Viliam
    Mereghetti, Carlo
    Palano, Beatrice
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 359 - +
  • [9] On the Representation of Real Numbers Using Regular Languages
    P. Lecomte
    M. Rigo
    Theory of Computing Systems, 2002, 35 : 13 - 38
  • [10] SUCCINCT REPRESENTATION OF REGULAR LANGUAGES BY BOOLEAN AUTOMATA
    LEISS, E
    THEORETICAL COMPUTER SCIENCE, 1981, 13 (03) : 323 - 330
12345