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 条
  • [1] Efficient determinization of visibly and height-deterministic pushdown automata
    Polach, Radomir
    Travnicek, Jan
    Janousek, Jan
    Melichar, Borivoj
    COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2016, 46 : 91 - 105
  • [2] Symbolic Visibly Pushdown Automata
    D'Antoni, Loris
    Alur, Rajeev
    COMPUTER AIDED VERIFICATION, CAV 2014, 2014, 8559 : 209 - 225
  • [3] Trimming visibly pushdown automata
    Caralp, Mathieu
    Reynier, Pierre-Alain
    Talbot, Jean-Marc
    THEORETICAL COMPUTER SCIENCE, 2015, 578 : 13 - 29
  • [4] Extending Visibly Pushdown Automata over Multi-matching Nested Relations
    Liu, Jin
    Xiao, Yeqiu
    Wang, Haiyang
    Wang, Wensheng
    STRUCTURED OBJECT-ORIENTED FORMAL LANGUAGE AND METHOD, SOFL+MSVL 2022, 2023, 13854 : 59 - 69
  • [5] Minimizing variants of visibly pushdown automata
    Chervet, Patrick
    Walukiewicz, Igor
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 135 - +
  • [6] Visibly Pushdown Automata and Transducers with Counters
    Ibarra, Oscar H.
    FUNDAMENTA INFORMATICAE, 2016, 148 (3-4) : 291 - 308
  • [7] 2-visibly pushdown automata
    Carotenuto, Dario
    Murano, Aniello
    Peron, Adriano
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2007, 4588 : 132 - +
  • [8] A New Algorithm for the Determinisation of Visibly Pushdown Automata
    Polach, Radomir
    Travanicek, Jan
    Janousek, Jan
    Melichar, Borivoj
    PROCEEDINGS OF THE 2015 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2015, 5 : 915 - 922
  • [9] Right-Universality of Visibly Pushdown Automata
    Bruyere, Veronique
    Ducobu, Marc
    Gauwin, Olivier
    RUNTIME VERIFICATION, RV 2013, 2013, 8174 : 76 - 93
  • [10] A Tighter Bound for the Determinization of Visibly Pushdown Automata
    Nguyen Van Tang
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (10): : 62 - 76
12345