EFFICIENT CONSTRUCTIONS OF TEST SETS FOR REGULAR AND CONTEXT-FREE LANGUAGES

被引：0
|
作者：
KARHUMAKI, J [1 ]
RYTTER, W [1 ]
JAROMINEK, S [1 ]
机构：
[1] UNIV WARSAW, INST INFORMAT, PL-00325 WARSAW, POLAND
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 520卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present a simple construction of linear size test sets for regular languages and of single exponential test sets for context free languages. In the case of regular sets the size of our test set is exactly the number of transitions of the automaton. This improves the best known upper bounds: exponential for regular and doubly exponential for context-free languages. We give also an O(n log n) time algorithm for the morphism equivalence and an O(n3log n) time algorithm to best the gsm equivalence on a regular language. An O(n2log n) time algorithm is given to test the equivalence of two deterministic gsm's as well as that of two deterministic finite transducers.
引用
收藏
页码：249 / 258
页数：10
相关论文
共 50 条
  • [1] EFFICIENT CONSTRUCTIONS OF TEST SETS FOR REGULAR AND CONTEXT-FREE LANGUAGES
    KARHUMAKI, J
    RYTTER, W
    JAROMINEK, S
    THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) : 305 - 316
  • [2] Boundary sets of regular and context-free languages
    Holzer, Markus
    Jakobi, Sebastian
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 59 - 77
  • [3] Boundary Sets of Regular and Context-Free Languages
    Holzer, Markus
    Jakobi, Sebastian
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 162 - 173
  • [4] 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
  • [5] POLYNOMIAL SIZE TEST SETS FOR CONTEXT-FREE LANGUAGES
    KARHUMAKI, J
    PLANDOWSKI, W
    RYTTER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 53 - 64
  • [6] Regular patterns, regular languages and context-free languages
    Jain, Sanjay
    Ong, Yuh Shin
    Stephan, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1114 - 1119
  • [7] On the Density of Regular and Context-Free Languages
    Hartwig, Michael
    COMPUTING AND COMBINATORICS, 2010, 6196 : 318 - 327
  • [8] Directed Regular and Context-Free Languages
    Ganardi, Moses
    Saglam, Irmak
    Zetzsche, Georg
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [9] ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES
    Hartwig, Michael
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2010, 2 (04) : 505 - 514
  • [10] On the Intersection of Context-Free and Regular Languages
    Pasti, Clemente
    Opedal, Andreas
    Pimentel, Tiago
    Vieira, Tim
    Eisner, Jason
    Cotterell, Ryan
    17TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EACL 2023, 2023, : 737 - 749
12345