Pumping lemma for Deterministic Context-Free Languages

被引：0
|
作者：
机构：
[1] Yu, Sheng
来源：
Yu, Sheng | 1600年 / 31期
关键词：
Automata Theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] A PUMPING LEMMA FOR DETERMINISTIC CONTEXT-FREE LANGUAGES
    YU, S
    INFORMATION PROCESSING LETTERS, 1989, 31 (01) : 47 - 51
  • [2] A PUMPING LEMMA FOR REAL-TIME DETERMINISTIC CONTEXT-FREE LANGUAGES
    IGARASHI, Y
    THEORETICAL COMPUTER SCIENCE, 1985, 36 (01) : 89 - 97
  • [3] A Structural Lemma for Deterministic Context-Free Languages
    Rubtsov, Alexander A.
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 553 - 565
  • [4] Formalization of the Pumping Lemma for Context-Free Languages
    Ramos, M. V. M.
    De Queiroz, R. J. G. B.
    Moreira, N.
    Almeida, J. C. B.
    JOURNAL OF FORMALIZED REASONING, 2016, 9 (02): : 53 - 68
  • [5] The Pumping Lemma for Context-Free Languages is Undecidable
    Gruber, Hermann
    Holzer, Markus
    Rauch, Christian
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2024, 2024, 14791 : 141 - 155
  • [6] Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages
    Ramos, Marcus V. M.
    Bacelar Almeida, Jose Carlos
    Moreira, Nelma
    de Queiroz, Ruy J. G. B.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 344 : 151 - 167
  • [7] The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
    Kanazawa, Makoto
    Kobele, Gregory M.
    Michaelis, Jens
    Salvati, Sylvain
    Yoshinaka, Ryo
    THEORY OF COMPUTING SYSTEMS, 2014, 55 (01) : 250 - 278
  • [8] The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
    Makoto Kanazawa
    Gregory M. Kobele
    Jens Michaelis
    Sylvain Salvati
    Ryo Yoshinaka
    Theory of Computing Systems, 2014, 55 : 250 - 278
  • [9] The Pumping Lemma for Well-Nested Multiple Context-Free Languages
    Kanazawa, Makoto
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 312 - 325
  • [10] USING THE CONTEXT-FREE PUMPING LEMMA
    BILLINGTON, D
    COMMUNICATIONS OF THE ACM, 1993, 36 (04) : 21 - &
12345