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 条
  • [1] CHECKING SETS, TEST SETS, RICH LANGUAGES AND COMMUTATIVELY CLOSED LANGUAGES
    ALBERT, J
    WOOD, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 26 (01) : 82 - 91
  • [2] TEST SETS FOR LANGUAGES OF INFINITE WORDS
    DELUCA, A
    PELAGALLI, M
    VARRICCHIO, S
    INFORMATION PROCESSING LETTERS, 1988, 29 (02) : 91 - 95
  • [3] Parikh test sets for commutative languages
    Holub, Stepan
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2008, 42 (03): : 525 - 537
  • [4] Polynomial size test sets for commutative languages
    Hakala, I
    Kortelainen, J
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (03): : 291 - 304
  • [5] TEST SETS FOR HOMOMORPHISM EQUIVALENCE ON CONTEXT FREE LANGUAGES
    ALBERT, J
    CULIK, K
    INFORMATION AND CONTROL, 1980, 45 (03): : 273 - 284
  • [6] Linear size test sets for certain commutative languages
    Holub, S
    Kortelainen, J
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (05): : 453 - 475
  • [7] POLYNOMIAL SIZE TEST SETS FOR CONTEXT-FREE LANGUAGES
    KARHUMAKI, J
    PLANDOWSKI, W
    RYTTER, W
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (01) : 11 - 19
  • [8] TEST PROCEDURES AND TEST SETS FOR LARGE EMD PABXs
    Bitzl, Walter
    Nottnagel, Wolf
    1600, (08):
  • [9] POLYNOMIAL SIZE TEST SETS FOR CONTEXT-FREE LANGUAGES
    KARHUMAKI, J
    PLANDOWSKI, W
    RYTTER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 53 - 64
  • [10] Test sets for the universal and existential closure of regular tree languages
    Hofbauer, D
    Huber, M
    INFORMATION AND COMPUTATION, 2002, 178 (02) : 465 - 498
12345