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 条
  • [31] Finite turns and the regular closure of linear context-free languages
    Kutrib, Martin
    Malcher, Andreas
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2152 - 2164
  • [32] A complete refinement procedure for regular separability of context-free languages
    Gange, Graeme
    Navas, Jorge A.
    Schachte, Peter
    Sondergaard, Harald
    Stuckey, Peter J.
    THEORETICAL COMPUTER SCIENCE, 2016, 625 : 1 - 24
  • [33] ON CONTEXT-FREE LANGUAGES
    PARIKH, RJ
    JOURNAL OF THE ACM, 1966, 13 (04) : 570 - +
  • [34] Regular Approximation of Weighted Linear Context-Free Tree Languages
    Teichmann, Markus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (05) : 523 - 542
  • [35] Regular and Context-Free Pattern Languages over Small Alphabets
    Reidenbach, Daniel
    Schmid, Markus L.
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 130 - 141
  • [36] Regular and context-free pattern languages over small alphabets
    Reidenbach, Daniel
    Schmid, Markus L.
    THEORETICAL COMPUTER SCIENCE, 2014, 518 : 80 - 95
  • [37] EQUIVALENCE, CONTAINMENT, AND COVERING PROBLEMS FOR REGULAR AND CONTEXT-FREE LANGUAGES
    HUNT, HB
    ROSENKRANTZ, DJ
    SZYMANSKI, TG
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 12 (02) : 222 - 268
  • [38] A NOTE ON AMBIGUITY OF CONTEXT-FREE LANGUAGES AND PRESENTATIONS OF SEMILINEAR SETS
    ROSENBERG, AL
    JOURNAL OF THE ACM, 1970, 17 (01) : 44 - +
  • [39] Efficient computation of throughput values of context-free languages
    Caucal, Didier
    Czyzowicz, Jurek
    Fraczak, Wojciech
    Rytter, Wojciech
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 203 - +
  • [40] AN EFFICIENT RECOGNIZER FOR THE BOOLEAN CLOSURE OF CONTEXT-FREE LANGUAGES
    HEILBRUNNER, S
    SCHMITZ, L
    THEORETICAL COMPUTER SCIENCE, 1991, 80 (01) : 53 - 75
12345