Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata

被引：0
|
作者：
Selivanov, Victor [1 ,2 ]
机构：
[1] AP Ershov Inst Informat Syst, Novosibirsk, Russia
[2] St Petersburg State Univ, Dept Math & Comp Sci, St Petersburg, Russia
来源：
UNITY OF LOGIC AND COMPUTATION, CIE 2023 | 2023年 / 13967卷
基金：
俄罗斯科学基金会;
关键词：
Visibly pushdown automaton; Wagner's hierarchy; omega-language; k-partition; stack height; Wadge reducibility; LANGUAGES;
D O I：
10.1007/978-3-031-36978-0_16
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We extend the Wagner hierarchy of.-regular k-partitions to visibly pushdown languages on infinite words of bounded stack height. In particular, the structure of Wadge degrees of such k-partitions is shown to be isomorphic to the corresponding structure for the case of finite automata. We show that also computability properties of the Wagner hierarchy survive.
引用
收藏
页码：190 / 201
页数：12
相关论文
共 50 条
  • [41] On regular tree languages and deterministic pushdown automata
    Janousek, Jan
    Melichar, Borivoj
    ACTA INFORMATICA, 2009, 46 (07) : 533 - 547
  • [42] 2 DECIDABILITY RESULTS FOR DETERMINISTIC PUSHDOWN AUTOMATA
    LINNA, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) : 92 - 107
  • [43] DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC STATELESS PUSHDOWN AUTOMATA
    OYAMAGUCHI, M
    HONDA, N
    INFORMATION AND CONTROL, 1978, 38 (03): : 367 - 376
  • [44] Deterministic Pushdown Automata with Translucent Input Letters
    Kutrib, Martin
    Malcher, Andreas
    Mereghetti, Carlo
    Palano, Beatrice
    Raucci, Priscilla
    Wendlandt, Matthias
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2024, 2024, 14791 : 203 - 217
  • [45] Simplification Problems for Deterministic Pushdown Automata on Infinite Words
    Loeding, Christof
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (08) : 1041 - 1068
  • [46] Decision Problems for Deterministic Pushdown Automata on Infinite Words
    Loeding, Christof
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 55 - 73
  • [47] DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN-AUTOMATA
    MEITUS, VY
    CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (05) : 672 - 690
  • [48] SYNCHRONIZABLE DETERMINISTIC PUSHDOWN-AUTOMATA AND THE DECIDABILITY OF THEIR EQUIVALENCE
    CULIK, K
    KARHUMAKI, J
    ACTA INFORMATICA, 1986, 23 (05) : 597 - 605
  • [49] Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
    Benedek Nagy
    Friedrich Otto
    Acta Informatica, 2013, 50 : 229 - 255
  • [50] Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
    Nagy, Benedek
    Otto, Friedrich
    ACTA INFORMATICA, 2013, 50 (04) : 229 - 255
12345