CHARACTERIZATIONS OF PUSHDOWN LANGUAGES BY TIME COMPLEXITY . PRELIMINARY REPORT

被引：0
|
作者：
COOK, SA
机构：
来源：
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY | 1969年 / 16卷 / 02期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：435 / &
相关论文
共 50 条
  • [1] TIME AND TAPE COMPLEXITY OF PUSHDOWN AUTOMATON LANGUAGES
    AHO, AV
    HOPCROFT, JE
    ULLMAN, JD
    INFORMATION AND CONTROL, 1968, 13 (03): : 186 - &
  • [2] Language Acceptors with a Pushdown: Characterizations and Complexity
    Ibarra, Oscar H.
    McQuillan, Ian
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [3] Descriptional Complexity of Pushdown Store Languages
    Malcher, Andreas
    Meckel, Katja
    Mereghetti, Carlo
    Palano, Beatrice
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 209 - 221
  • [4] The AC0-Complexity of Visibly Pushdown Languages
    Goeller, Stefan
    Grosshans, Nathan
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [5] The AC0-Complexity of Visibly Pushdown Languages
    Göller, Stefan
    Grosshans, Nathan
    Leibniz International Proceedings in Informatics, LIPIcs, 289
  • [6] COMPLEXITY CHARACTERIZATIONS OF ATTRIBUTE GRAMMAR LANGUAGES
    EFREMIDIS, S
    PAPADIMITRIOU, CH
    SIDERIS, M
    INFORMATION AND COMPUTATION, 1988, 78 (03) : 178 - 186
  • [7] TIME-COMPLEXITY OF LANGUAGES RECOGNIZED BY ONE-WAY MULTIHEAD PUSHDOWN-AUTOMATA
    RYTTER, W
    INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 142 - 144
  • [8] CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS
    COOK, SA
    JOURNAL OF THE ACM, 1971, 18 (01) : 4 - &
  • [9] Invisible Pushdown Languages
    Kopczynski, Eryk
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 867 - 872
  • [10] On the complexity of ω-pushdown automata
    Yusi Lei
    Fu Song
    Wanwei Liu
    Min Zhang
    Science China Information Sciences, 2017, 60
12345