We develop an automata-theoretic framework for reasoning about infinitestate sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal propert...

Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure properties. We propose a generalization of the visibly pushdown automata of Alur and Madhusudan ...

One of the primary aims China’s territory spatial planning is to control urban sprawl local municipals and prevent regional competition negative consequences on environment—which emphasizes top-down regulation. Indeed, traditional cellular automaton (CA) model still has limitations when applied whole administration area since it may ignore differences among cities towns. Thus, this paper propos...

Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important properties of these regions and the associated trees. We compute the depth of a rooted tree, its diameter and the center which becomes the root in the top-down decomposition of a region. The integral tree is an intermediate...

A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string.

Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notion of automaton is defined and shown, by means of a tableau technique, to capture the expressive power of fixpoint expressions. For interpretation over continuous and complete lattices, when, moreover, the meet symbol ^ commutes in a rough sense with all other functio...

We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deterministic) bottom-up tree transducer except that it translates trees into hypergraphs rather than trees, using hypergraph substitution instead of tree substitution. If every output hypergraph of the transducer is a jungle, i.e., a hypergraph that can be unfolded into a tree, then the tree-to-graph...

This article presents the basic theory of automata on infinite trees. We introduce the standard model of nondeterministic automata and the generalization to alternating automata. The central part of the theory considers the closure properties of tree languages definable by such automata, the equivalence of the different models, and their algorithmic properties. We show how these results are obt...