scholarly journals TREE AUTOMATA WITH GLOBAL CONSTRAINTS

2010 ◽  
Vol 21 (04) ◽  
pp. 571-596 ◽  
Author(s):  
EMMANUEL FILIOT ◽  
JEAN-MARC TALBOT ◽  
SOPHIE TISON

We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, they are equipped with an equality relation and a disequality relation on states, so that whenever two subtrees t and t′ evaluate (in an accepting run) to two states which are in the (dis)equality relation, they must be (dis)equal. We study several properties of TAGEDs, and prove emptiness decidability of for several expressive subclasses of TAGEDs.

Author(s):  
Emmanuel Filiot ◽  
Jean-Marc Talbot ◽  
Sophie Tison

2013 ◽  
Vol 9 (2) ◽  
Author(s):  
Luis Barguñó ◽  
Carles Creus ◽  
Guillem Godoy ◽  
Florent Jacquemard ◽  
Camille Vacher

Author(s):  
Luis Barguno ◽  
Carles Creus ◽  
Guillem Godoy ◽  
Florent Jacquemard ◽  
Camille Vacher

Author(s):  
Michael Silberstein ◽  
W.M. Stuckey ◽  
Timothy McDevitt

The main thread of chapter 4 introduces some of the major mysteries and interpretational issues of quantum mechanics (QM). These mysteries and issues include: quantum superposition, quantum nonlocality, Bell’s inequality, entanglement, delayed choice, the measurement problem, and the lack of counterfactual definiteness. All these mysteries and interpretational issues of QM result from dynamical explanation in the mechanical universe and are dispatched using the authors’ adynamical explanation in the block universe, called Relational Blockworld (RBW). A possible link between RBW and quantum information theory is provided. The metaphysical underpinnings of RBW, such as contextual emergence, spatiotemporal ontological contextuality, and adynamical global constraints, are provided in Philosophy of Physics for Chapter 4. That is also where RBW is situated with respect to retrocausal accounts and it is shown that RBW is a realist, psi-epistemic account of QM. All the relevant formalism for this chapter is provided in Foundational Physics for Chapter 4.


1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki

Closure properties of binary ETOL-languages are investigated by means of multiple tree automata. Decidability of the equivalence problem of deterministic binary ETOL-systems is proved.


2021 ◽  
Vol 16 (2) ◽  
pp. 1-23
Author(s):  
Zhao Li ◽  
Junshuai Song ◽  
Zehong Hu ◽  
Zhen Wang ◽  
Jun Gao

Impression regulation plays an important role in various online ranking systems, e.g. , e-commerce ranking systems always need to achieve local commercial demands on some pre-labeled target items like fresh item cultivation and fraudulent item counteracting while maximizing its global revenue. However, local impression regulation may cause “butterfly effects” on the global scale, e.g. , in e-commerce, the price preference fluctuation in initial conditions (overpriced or underpriced items) may create a significantly different outcome, thus affecting shopping experience and bringing economic losses to platforms. To prevent “butterfly effects”, some researchers define their regulation objectives with global constraints, by using contextual bandit at the page-level that requires all items on one page sharing the same regulation action, which fails to conduct impression regulation on individual items. To address this problem, in this article, we propose a personalized impression regulation method that can directly makes regulation decisions for each user-item pair. Specifically, we model the regulation problem as a C onstrained D ual-level B andit (CDB) problem, where the local regulation action and reward signals are at the item-level while the global effect constraint on the platform impression can be calculated at the page-level only. To handle the asynchronous signals, we first expand the page-level constraint to the item-level and then derive the policy updating as a second-order cone optimization problem. Our CDB approaches the optimal policy by iteratively solving the optimization problem. Experiments are performed on both offline and online datasets, and the results, theoretically and empirically, demonstrate CDB outperforms state-of-the-art algorithms.


1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.


Sign in / Sign up

Export Citation Format

Share Document