An axiomatic definition of context-free rewriting and its application to NLC graph grammars

1988 ◽  
pp. 237-247 ◽  
Author(s):  
B. Courcelle
Keyword(s):  
Graph Grammars ◽  
Axiomatic Definition ◽  
Definition Of ◽  
Context Free

scholarly journals A comparison of boundary graph grammars and context-free hypergraph grammars

1990 ◽  
Vol 84 (2) ◽  
pp. 163-206 ◽  
Author(s):  
Joost Engelfiet ◽  
Grzegorz Rozenberg
Keyword(s):  
Graph Grammars ◽  
Context Free ◽  
Boundary Graph

scholarly journals Context-free graph grammars

1978 ◽  
Vol 37 (2) ◽  
pp. 207-233 ◽  
Author(s):  
Pierluigi Della Vigna ◽  
Carlo Ghezzi
Keyword(s):  
Graph Grammars ◽  
Free Graph ◽  
Context Free

scholarly journals Quasi-Perfect Stackelberg Equilibrium

2019 ◽  
Vol 33 ◽  
pp. 2117-2124 ◽  
Author(s):  
Alberto Marchesi ◽  
Gabriele Farina ◽  
Christian Kroer ◽  
Nicola Gatti ◽  
Tuomas Sandholm
Keyword(s):  
Broad Class ◽  
Stackelberg Equilibrium ◽  
Correlated Equilibrium ◽  
Equilibrium Concept ◽  
Extensive Form ◽  
Tree Form ◽  
Axiomatic Definition ◽  
Security Games ◽  
Definition Of ◽  
Perfect Equilibria

Equilibrium refinements are important in extensive-form (i.e., tree-form) games, where they amend weaknesses of the Nash equilibrium concept by requiring sequential rationality and other beneficial properties. One of the most attractive refinement concepts is quasi-perfect equilibrium. While quasiperfection has been studied in extensive-form games, it is poorly understood in Stackelberg settings—that is, settings where a leader can commit to a strategy—which are important for modeling, for example, security games. In this paper, we introduce the axiomatic definition of quasi-perfect Stackelberg equilibrium. We develop a broad class of game perturbation schemes that lead to them in the limit. Our class of perturbation schemes strictly generalizes prior perturbation schemes introduced for the computation of (non-Stackelberg) quasi-perfect equilibria. Based on our perturbation schemes, we develop a branch-and-bound algorithm for computing a quasi-perfect Stackelberg equilibrium. It leverages a perturbed variant of the linear program for computing a Stackelberg extensive-form correlated equilibrium. Experiments show that our algorithm can be used to find an approximate quasi-perfect Stackelberg equilibrium in games with thousands of nodes.

scholarly journals DEFORMATION CONDITIONS FOR PSEUDOREPRESENTATIONS

2019 ◽  
Vol 7 ◽  
Author(s):  
PRESTON WAKE ◽  
CARL WANG-ERICKSON
Keyword(s):  
Stability Condition ◽  
Deformation Theory ◽  
Axiomatic Definition ◽  
Galois Deformation ◽  
Definition Of

Given a property of representations satisfying a basic stability condition, Ramakrishna developed a variant of Mazur’s Galois deformation theory for representations with that property. We introduce an axiomatic definition of pseudorepresentations with such a property. Among other things, we show that pseudorepresentations with a property enjoy a good deformation theory, generalizing Ramakrishna’s theory to pseudorepresentations.

scholarly journals QUANTUM COUNTER AUTOMATA

2012 ◽  
Vol 23 (05) ◽  
pp. 1099-1116 ◽  
Author(s):  
A. C. CEM SAY ◽  
ABUZER YAKARYILMAZ
Keyword(s):  
Real Time ◽  
Finite Automata ◽  
Affirmative Answer ◽  
Quantum Model ◽  
Open Problems ◽  
Modern Approach ◽  
Context Free Language ◽  
Definition Of ◽  
Context Free ◽  
Free Language

The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide general definitions of these models that reflect the modern approach to the definition of quantum finite automata, and point out some problems with previous results. We identify several remaining open problems.

Sign in / Sign up

Export Citation Format

Share Document