Displaying similar documents to “The μ-calculus alternation-depth hierarchy is strict on binary trees”

Hopcroft's algorithm and tree-like automata

G. Castiglione, A. Restivo, M. Sciortino (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard...

Hopcroft's algorithm and tree-like automata

G. Castiglione, A. Restivo, M. Sciortino (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard...

Choice functions and well-orderings over the infinite binary tree

Arnaud Carayol, Christof Löding, Damian Niwinski, Igor Walukiewicz (2010)

Open Mathematics

Similarity:

We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by Gurevich and Shelah using set theoretical arguments. Our proof is much simpler and only uses basic tools from automata theory. We show how the result can be used to prove the inherent ambiguity of languages of infinite trees. In a second part we strengthen the result of the non-existence of an MSO-definable...

Galvin Tree-Games

E. C. Milner (1985)

Publications du Département de mathématiques (Lyon)

Similarity:

Club-guessing and non-structure of trees

Tapani Hyttinen (2001)

Fundamenta Mathematicae

Similarity:

We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.

Morphospace: Measurement, Modeling, Mathematics, and Meaning

N. Khiripet, R. Viruchpintu, J. Maneewattanapluk, J. Spangenberg, J.R. Jungck (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

Artists have long recognized that trees are self-similar across enormous differences in magnitudes; i.e., they share a common fractal structure - a trunk subdivides into branches which subdivide into more branches which eventually terminate in leaves, flowers, fruits, etc. Artistid Lindenmayer (1971, 1975, 1989, 1990) invented a mathematics based on graph grammar rewriting systems to describe such iteratively branching structures; these were named in honor of him and are referred to...