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 条

[31] A Logical Characterization for Dense-Time Visibly Pushdown Automata
Bhave, Devendra
Dave, Vrunda
Krishna, Shankara Narayanan
Phawade, Ramchandra
Trivedi, Ashutosh
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 89 - 101
[32] Two-Way Parikh Automata with a Visibly Pushdown Stack
Dartois, Luc
Filiot, Emmanuel
Talbot, Jean-Marc
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2019, 2019, 11425 : 189 - 206
[33] ON THE EXPRESSIVE POWER OF 2-STACK VISIBLY PUSHDOWN AUTOMATA
Bollig, Benedikt
LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (04)
[34] REGULARITY AND RELATED PROBLEMS FOR DETERMINISTIC PUSHDOWN AUTOMATA
VALIANT, LG
JOURNAL OF THE ACM, 1975, 22 (01) : 1 - 10
[35] Minimization of Visibly Pushdown Automata Using Partial Max-SAT
Heizmann, Matthias
Schilling, Christian
Tischner, Daniel
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2017, PT I, 2017, 10205 : 461 - 478
[36] A SIMPLICITY TEST FOR DETERMINISTIC PUSHDOWN-AUTOMATA
OYAMAGUCHI, M
INAGAKI, Y
HONDA, N
INFORMATION AND CONTROL, 1980, 47 (01): : 10 - 36
[37] Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown Automata
Van Tang, Nguyen
Ohsaki, Hitoshi
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (12) : 2794 - 2801
[38] On regular tree languages and deterministic pushdown automata
Jan Janoušek
Bořivoj Melichar
Acta Informatica, 2009, 46 : 533 - 547
[39] RESULT ON EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN AUTOMATA
TANIGUCHI, K
KASAMI, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (01) : 38 - 50
[40] The equivalence problem for deterministic pushdown automata is decidable
Senizergues, G
AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 671 - 681

← 1 2 3 4 5 →