Coincidental extension of scattered context languages

被引：0
|
作者：
Alexander Meduna
机构：
[1] Brno University Technology,Faculty of Information Tecnology
来源：
Acta Informatica | 2003年 / 39卷
关键词：
Change Step; Context Language; Paper Hold; Scattered Context; Coincidental Extension;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
All the results given in the paper hold true. In the proof of Theorem 1, change steps IV, V, and VI to
引用
收藏
页码：699 / 699
相关论文
共 50 条
  • [21] The growing context-sensitive languages are the acyclic context-sensitive languages
    Niemann, G
    Woinowski, JR
    DEVELOPMENTS IN LANGUAGE THEORY, 2002, 2295 : 197 - 205
  • [22] Series-parallel languages on scattered and countable posets
    Bedon, Nicolas
    Rispal, Chloe
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (22) : 2356 - 2369
  • [23] Series-parallel languages on scattered and countable posets
    Bedon, Nicolas
    Rispal, Chloe
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 477 - +
  • [24] Scattered Context Grammar in Hindi Linguistics
    Singla, Manisha
    Kumar, Ajay
    2017 IEEE INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION, INSTRUMENTATION AND CONTROL (ICICIC), 2017,
  • [25] On the degree of scattered context-sensitivity
    Fernau, H
    Meduna, A
    THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 2121 - 2124
  • [26] CHART PARSING OF SCATTERED CONTEXT GRAMMARS
    POPOWICH, F
    APPLIED MATHEMATICS LETTERS, 1994, 7 (01) : 35 - 40
  • [27] SYNTACTIC COMPLEXITY OF SCATTERED CONTEXT GRAMMARS
    MEDUNA, A
    ACTA INFORMATICA, 1995, 32 (03) : 285 - 298
  • [28] Maximal and minimal scattered context rewriting
    Meduna, Alexander
    Techet, Jiri
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2007, 4639 : 412 - +
  • [29] On the descriptional complexity of scattered context grammars
    Masopust, Tomas
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (01) : 108 - 112
  • [30] SOME CONTEXT FREE LANGUAGES THAT ARE NOT DETERMINISTIC ETOL LANGUAGES
    EHRENFEUCHT, A
    ROZENBERG, G
    RAIRO-INFORMATIQUE-COMPUTER SCIENCE, 1977, 11 (04): : 273 - 291
12345