scholarly journals LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata

2016 ◽  
Vol 82 (8) ◽  
pp. 1329-1359 ◽  
Author(s):  
Tamar Aizikowitz ◽  
Michael Kaminski
Keyword(s):  
Conjunctive Grammars ◽  
Pushdown Automata

LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA

2014 ◽  
Vol 25 (06) ◽  
pp. 781-802 ◽  
Author(s):  
TAMAR AIZIKOWITZ ◽  
MICHAEL KAMINSKI
Keyword(s):  
Models Of Computation ◽  
Conjunctive Grammars ◽  
Natural Counterpart ◽  
Pushdown Automata

In this paper we introduce a subfamily of synchronized alternating pushdown automata, one-turn synchronized alternating pushdown automata, which accept the same class of languages as those generated by linear conjunctive grammars. This equivalence of models of computation is analogous to the classical equivalence between one-turn pushdown automata and linear grammars, thus strengthening the claim of synchronized alternating pushdown automata as a natural counterpart of conjunctive grammars.

Conjunctive grammars and alternating pushdown automata

2013 ◽  
Vol 50 (3) ◽  
pp. 175-197 ◽  
Author(s):  
Tamar Aizikowitz ◽  
Michael Kaminski
Keyword(s):  
Conjunctive Grammars ◽  
Pushdown Automata

scholarly journals Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre
Keyword(s):  
Model Checking ◽  
Free Variable ◽  
Higher Order ◽  
Second Order ◽  
Effective Solution ◽  
Parity Games ◽  
Transition Graphs ◽  
Second Order Logic ◽  
Pushdown Automata ◽  
Monadic Second Order Logic

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

scholarly journals From Security Protocols to Pushdown Automata

2015 ◽  
Vol 17 (1) ◽  
pp. 1-45 ◽  
Author(s):  
Rémy Chrétien ◽  
Véronique Cortier ◽  
Stéphanie Delaune
Keyword(s):  
Security Protocols ◽  
Pushdown Automata

scholarly journals Reachability relations of timed pushdown automata

2021 ◽  
Vol 117 ◽  
pp. 202-241
Author(s):  
Lorenzo Clemente ◽  
Sławomir Lasota
Keyword(s):  
Pushdown Automata
Sign in / Sign up

Export Citation Format

Share Document