Discounted Properties of Probabilistic Pushdown Automata

被引：6

作者：

Brazdil, Tomas ^{[1
]}

Brozek, Vaclav ^{[1
]}

Holecek, Jan ^{[1
]}

Kucera, Antonin ^{[1
]}

机构：

[1] Masaryk Univ, Fac Informat, Brno 60200, Czech Republic

来源：

LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS | 2008年 / 5330卷

关键词：

D O I：

10.1007/978-3-540-89439-1_17

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We show that several basic discounted properties of probabilistic pushdown automata related both to terminating and non-terminating runs can be efficiently approximated up to an arbitrarily small given precision.

引用

页码：230 / 242

页数：13

共 50 条

[41] Pushdown cellular automata
Kutrib, M
THEORETICAL COMPUTER SCIENCE, 1999, 215 (1-2) : 239 - 261
[42] Blackhole Pushdown Automata
Csuhaj-Varju, Erzsebet
Masopust, Tomas
Vaszil, Gyoergy
FUNDAMENTA INFORMATICAE, 2011, 112 (2-3) : 137 - 156
[43] PUSHDOWN TREE AUTOMATA
GUESSARIAN, I
MATHEMATICAL SYSTEMS THEORY, 1983, 16 (04): : 237 - 263
[44] Deep pushdown automata
Meduna, A
ACTA INFORMATICA, 2006, 42 (8-9) : 541 - 552
[45] Pushdown automata, multiset automata, and Petri nets
Hirshfeld, Y
Moller, F
THEORETICAL COMPUTER SCIENCE, 2001, 256 (1-2) : 3 - 21
[46] Fundamental properties of bottom-up pushdown tree automata
Yamasaki, Katsunori, 1600, (21):
[47] Further closure properties of input-driven pushdown automata
Okhotin, Alexander
Salomaa, Kai
THEORETICAL COMPUTER SCIENCE, 2019, 798 : 65 - 77
[48] String Suffix Automata and Subtree Pushdown Automata
Janousek, Jan
PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 160 - 172
[49] Further Closure Properties of Input-Driven Pushdown Automata
Okhotin, Alexander
Salomaa, Kai
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 224 - 236
[50] Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata
Otto, Friedrich
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 244 - 251

← 1 2 3 4 5 →