The Emptiness Problem for Tree Automata with Global Constraints

Different systolic tree automata (STA) with base (T(b)−STA) are compared. This is a subclass of STA with interesting properties of modularity. We give a necessary and sufficient condition for the inclusion between classes of languages accepted by T(b)− STA, (L(T(b)−STA)), as b varies. We focus on T(b)−STA obtained by varying the base b in a natural way. We prove that for every base b within this framework there exists an a such that L(T(a)−STA) is not contained in L(T(b)−STA). We characterize the family of languages accepted by T(b)−STA when the input conditions are relaxed. Moreover we show that the emptiness problem is decidable for T(b)−STA.

Download Full-text

On the emptiness problem of tree automata and completeness of modal logics of programs

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026315 ◽

2005 ◽

pp. 384-399

Author(s):

Hubert Wagner

Keyword(s):

Modal Logics ◽

Tree Automata ◽

Emptiness Problem ◽

Logics Of Programs

Download Full-text

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Logical Methods in Computer Science ◽

10.2168/lmcs-9(2:1)2013 ◽

2013 ◽

Vol 9 (2) ◽

Cited By ~ 3

Author(s):

Luis Barguñó ◽

Carles Creus ◽

Guillem Godoy ◽

Florent Jacquemard ◽

Camille Vacher

Keyword(s):

Global Constraints ◽

Tree Automata ◽

Decidable Classes

Download Full-text

The emptiness problem for tree automata with at least one global disequality constraint is NP-hard

Information Processing Letters ◽

10.1016/j.ipl.2016.09.007 ◽

2017 ◽

Vol 118 ◽

pp. 6-9 ◽

Cited By ~ 1

Author(s):

P.-C. Héam ◽

V. Hugot ◽

O. Kouchnarenko

Keyword(s):

Np Hard ◽

Tree Automata ◽

Emptiness Problem

Download Full-text

TREE AUTOMATA WITH GLOBAL CONSTRAINTS

International Journal of Foundations of Computer Science ◽

10.1142/s012905411000743x ◽

2010 ◽

Vol 21 (04) ◽

pp. 571-596 ◽

Cited By ~ 14

Author(s):

EMMANUEL FILIOT ◽

JEAN-MARC TALBOT ◽

SOPHIE TISON

Keyword(s):

Global Constraints ◽

Tree Automata ◽

Equality Relation

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.

Download Full-text

Projection for Büchi Tree Automata with Constraints between Siblings

International Journal of Foundations of Computer Science ◽

10.1142/s012905412041004x ◽

2020 ◽

Vol 31 (06) ◽

pp. 749-775

Author(s):

Patrick Landwehr ◽

Christof Löding

Keyword(s):

Decision Procedure ◽

Order Logic ◽

Tree Automata ◽

Boolean Operations ◽

Regular Tree ◽

Infinite Trees ◽

Acceptance Condition ◽

Emptiness Problem ◽

Second Order Logic ◽

Monadic Second Order Logic

We consider an extension of tree automata on infinite trees that can use equality and disequality constraints between direct subtrees of a node. Recently, it has been shown that the emptiness problem for these kind of automata with a parity acceptance condition is decidable and that the corresponding class of languages is closed under Boolean operations. In this paper, we show that the class of languages recognizable by such tree automata with a Büchi acceptance condition is closed under projection. This construction yields a new algorithm for the emptiness problem, implies that a regular tree is accepted if the language is non-empty (for the Büchi condition), and can be used to obtain a decision procedure for an extension of monadic second-order logic with predicates for subtree comparisons.

Download Full-text

RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA

International Journal of Foundations of Computer Science ◽

10.1142/s012905410500325x ◽

2005 ◽

Vol 16 (04) ◽

pp. 723-741 ◽

Cited By ~ 11

Author(s):

ANDREAS MALETTI

Keyword(s):

Tree Automata ◽

Formal Representation ◽

Weighted Tree ◽

Bottom Up ◽

Operation Symbol ◽

Tree Series ◽

Pumping Lemma ◽

Emptiness Problem ◽

Weighted Tree Automata ◽

The Given

Bottom-up tree series transducers (tst) over the semiring [Formula: see text] are implemented with the help of bottom-up weighted tree automata (wta) over an extension of [Formula: see text]. Therefore bottom-up [Formula: see text]-weighted tree automata ([Formula: see text]-wta) with [Formula: see text] a distributive Ω-algebra are introduced. A [Formula: see text]-wta is essentially a wta but uses as transition weight an operation symbol of the Ω-algebra [Formula: see text] instead of a semiring element. The given tst is implemented with the help of a [Formula: see text]-wta, essentially showing that [Formula: see text]-wta are a joint generalization of tst (using IO-substitution) and wta. Then a semiring and a wta are constructed such that the wta computes a formal representation of the semantics of the [Formula: see text]-wta. The applicability of the obtained presentation result is demonstrated by deriving a pumping lemma for deterministic finite [Formula: see text]-wta from a known pumping lemma for deterministic finite wta. Finally, it is observed that the known decidability results for emptiness cannot be applied to obtain decidability of emptiness for finite [Formula: see text]-wta. Thus with help of a weaker version of the derived pumping lemma, decidability of the emptiness problem for finite [Formula: see text]-wta is shown under mild conditions on [Formula: see text].

Download Full-text

Relational Blockworld and Quantum Mechanics

10.1093/oso/9780198807087.003.0005 ◽

2018 ◽

Author(s):

Michael Silberstein ◽

W.M. Stuckey ◽

Timothy McDevitt

Keyword(s):

Quantum Mechanics ◽

Measurement Problem ◽

Quantum Nonlocality ◽

Global Constraints ◽

Quantum Superposition ◽

Delayed Choice ◽

Counterfactual Definiteness ◽

Main Thread ◽

Block Universe ◽

Contextual Emergence

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.

Download Full-text

Multiple Regularity and Binary ETOL-Systems1

Fundamenta Informaticae ◽

10.3233/fi-1981-4103 ◽

1981 ◽

Vol 4 (1) ◽

pp. 19-34

Author(s):

Ryszard Danecki

Keyword(s):

Equivalence Problem ◽

Tree Automata ◽

Closure Properties ◽

Multiple Tree

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.

Download Full-text