Test sets for large families of languages

被引：0
|
作者：
Plandowski, W [1 ]
机构：
[1] Warsaw Univ, Inst Informat, PL-02097 Warsaw, Poland
来源：
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS | 2003年 / 2710卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the lower and upper bounds for sizes of test sets for the families of all languages, of commutative languages, of regular languages and of context-free languages.
引用
收藏
页码：75 / 94
页数：20
相关论文
共 50 条
  • [31] Splicing in abstract families of languages
    Pixton, D
    THEORETICAL COMPUTER SCIENCE, 2000, 234 (1-2) : 135 - 166
  • [32] LOCALLY LINEAR FAMILIES OF LANGUAGES
    VANDERWALT, APJ
    INFORMATION AND CONTROL, 1976, 32 (01): : 27 - 32
  • [33] Families of locally testable languages
    Caron, P
    THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 361 - 376
  • [34] Large non-trivial t-intersecting families of signed sets
    Yao, Tian
    Lv, Benjian
    Wang, Kaishun
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2024, 89 : 32 - 48
  • [35] Negotiating Languages in Immigrant Families
    Medvedeva, Maria
    INTERNATIONAL MIGRATION REVIEW, 2012, 46 (02) : 517 - 545
  • [36] INTERSECTIONS OF SOME FAMILIES OF LANGUAGES
    BRANDENBURG, FJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 60 - 68
  • [37] Unions of identifiable families of languages
    Apsitis, K.
    Freivalds, R.
    Simanovskis, R.
    Smotrovs, J.
    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 1996, 1147
  • [38] 2 FAMILIES OF INCOMPARABLE LANGUAGES
    BEAUQUIER, J
    INFORMATION AND CONTROL, 1979, 43 (02): : 101 - 122
  • [39] ATOMS OF FAMILIES OF SETS
    RADO, R
    COMBINATORICA, 1982, 2 (03) : 311 - 314
  • [40] MAPPINGS OF FAMILIES OF SETS
    ALEKSAND.AD
    DOKLADY AKADEMII NAUK SSSR, 1970, 191 (03): : 503 - &
12345