One-variable context-free hedge automata

被引：1

作者：

Jacquemard, Florent ^{[1
]}

Rusinowitch, Michael ^{[2
]}

机构：

[1] INRIA Paris Rocquencourt, Ircam UMR, 1 Pl Igor Stravinsky, F-75004 Paris, France

[2] INRIA Nancy Grand Est, LORIA UMR, 615 Rue Jardin Bot, F-54602 Villers Les Nancy, France

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2019年 / 104卷

关键词：

Hedge automata; Rewrite closure; Verification; Static type checking; XQuery Update; Access control; TREE PUSHDOWN-AUTOMATA; XML; LANGUAGES;

D O I：

10.1016/j.jcss.2016.10.006

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We introduce an extension of hedge automata called One-Variable Context-Free Hedge Automata. The class of unranked ordered tree languages they recognize has polynomial membership problem and is preserved by rewrite closure with inverse-monadic rules. We also propose a modeling of primitives of the W3C XQuery Update Facility by mean of parameterized rewriting rules, and show that the rewrite closure of a context-free hedge language with these extended rewriting systems is a context-free hedge language. This result is applied to static analysis of XML access control policies expressed with update primitives. (C) 2016 Elsevier Inc. All rights reserved.

引用

页码：278 / 296

页数：19

共 50 条

[21] An Automata-Theoretical Characterization of Context-Free Trace Languages
Nagy, Benedek
Otto, Friedrich
SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 406 - 417
[22] Restarting tree automata and linear context-free tree languages
Stamer, Heiko
Otto, Friedrich
ALGEBRAIC INFORMATICS, 2007, 4728 : 275 - 289
[23] Pushdown automata free of explicit nondeterminism and an infinite hierarchy of context-free languages
Rene Callejas Bedregal, Benjamin
FUNDAMENTA INFORMATICAE, 2007, 81 (04) : 367 - 377
[24] Detecting One-Variable Patterns
Kosolobov, Dmitry
Manea, Florin
Nowotka, Dirk
STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2017), 2017, 10508 : 254 - 270
[25] Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
Lavado, Giovanna J.
Pighizzini, Giovanni
Seki, Shinnosuke
INFORMATION AND COMPUTATION, 2013, 228 : 1 - 15
[26] The One-Variable Fragment of T→
Slaney, John
Walker, Edward
JOURNAL OF PHILOSOPHICAL LOGIC, 2014, 43 (05) : 867 - 878
[27] Two ways of introducing alternation into context-free grammars and pushdown automata
Moriya, Etsuro
Otto, Friedrich
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (06) : 889 - 894
[28] Recognition of poly-slender context-free languages by trellis automata
Terrier, Veronique
THEORETICAL COMPUTER SCIENCE, 2017, 692 : 1 - 24
[29] Complexity Results on Register Context-Free Grammars and Register Tree Automata
Senda, Ryoma
Takata, Yoshiaki
Seki, Hiroyuki
THEORETICAL ASPECTS OF COMPUTING - ICTAC 2018, 2018, 11187 : 415 - 434
[30] Linear automata with translucent letters and linear context-free trace languages*
Nagy, Benedek
Otto, Friedrich
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2020, 54

← 1 2 3 4 5 →