On the Hausdorff measure of regular ω-languages in Cantor space

On the Hausdorff measure of regular ω-languages in Cantor space

Automata, Logic and Semantics

Bibliographic Details
Main Author:	Ludwig Staiger
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2015-05-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	set of locally positive measure decomposition muller automata </math>-language <math>&omega hausdorff measure [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
Online Access:	https://dmtcs.episciences.org/2112/pdf

Similar Items

Extending a perfect matching to a Hamiltonian cycle
by: Adel Alahmadi, et al.
Published: (2015-03-01)

Weak Positional Games on Hypergraphs of Rank Three
by: Martin Kutz
Published: (2005-01-01)

Gardens of Eden and Fixed Points in Sequential Dynamical Systems
by: Christopher Barrett, et al.
Published: (2001-01-01)

A Poset Classifying Non-Commutative Term Orders
by: Jan Snellman
Published: (2001-01-01)

A Cross Entropy Algorithm for Classification with $\delta$−Patterns
by: Gabriela Alexe, et al.
Published: (2006-01-01)

Left and right length of paths in binary trees or on a question of Knuth
by: Alois Panholzer
Published: (2006-01-01)

Snarks with total chromatic number 5
by: Gunnar Brinkmann, et al.
Published: (2015-05-01)

Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01)

Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes
by: Vladimir Blinovsky
Published: (2005-01-01)

Quadratic LYM-type inequalities for intersecting Sperner families
by: Christian Bey
Published: (2005-01-01)

Avoider-enforcer star games
by: Andrzej Grzesik, et al.
Published: (2015-03-01)

On additive combinatorics of permutations of ℤ<sub>n</sub>
by: L. Sunil Chandran, et al.
Published: (2014-06-01)

Limit distribution of the size of the giant component in a web random graph
by: Yuri Pavlov
Published: (2006-01-01)

Concentration Properties of Extremal Parameters in Random Discrete Structures
by: Michael Drmota
Published: (2006-01-01)

Cache efficient simple dynamic programming
by: Cary Cherng, et al.
Published: (2005-01-01)

The profile of unlabeled trees
by: Bernhard Gittenberger
Published: (2005-01-01)

And/or tree probabilities of Boolean functions
by: Danièle Gardy, et al.
Published: (2005-01-01)

Some results for monotonically labelled simply generated trees
by: Bernhard Gittenberger, et al.
Published: (2005-01-01)

The Lyapunov tortoise and the dyadic hare
by: Benoît Daireaux, et al.
Published: (2005-01-01)

A hooray for Poisson approximation
by: Rudolf Grübel
Published: (2005-01-01)

Order statistics and estimating cardinalities of massive data sets
by: Frédéric Giroire
Published: (2005-01-01)

Position of the maximum in a sequence with geometric distribution
by: Margaret Archibald
Published: (2005-01-01)

Quadratic exact-size and linear approximate-size random generation of planar graphs
by: Eric Fusy
Published: (2005-01-01)

The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
by: Guy Louchard, et al.
Published: (2005-01-01)

Pattern distribution in various types of random trees
by: Gerard Kok
Published: (2005-01-01)

Analysis of the average depth in a suffix tree under a Markov model
by: Julien Fayolle, et al.
Published: (2005-01-01)

LOGLOG counting for the estimation of IP traffic
by: Olivier Gandouet, et al.
Published: (2006-01-01)

Output sensitive algorithms for covering many points
by: Hossein Ghasemalizadeh, et al.
Published: (2015-04-01)

Enumeration of walks reaching a line
by: Philippe Nadeau
Published: (2005-01-01)

Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes
by: Iliya Bouyukliev, et al.
Published: (2005-01-01)

Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
by: Mikko Pelto
Published: (2015-05-01)

Graphs with large disjunctive total domination number
by: Michael A. Henning, et al.
Published: (2015-04-01)

Regular languages and associative language descriptions
by: Marcella Anselmo, et al.
Published: (2007-01-01)

Irregular edge coloring of 2-regular graphs
by: Sylwia Cichacz, et al.
Published: (2011-02-01)

A construction of small regular bipartite graphs of girth 8
by: Camino Balbuena
Published: (2009-01-01)

Survival probability of a critical multi-type branching process in random environment
by: Elena Dyakonova
Published: (2006-01-01)

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
by: Sergio Cabello, et al.
Published: (2015-01-01)

On probe 2-clique graphs and probe diamond-free graphs
by: Flavia Bonomo, et al.
Published: (2015-03-01)

Bootstrapping and double-exponential limit laws
by: Helmut Prodinger, et al.
Published: (2015-03-01)

Asymptotic analysis of a nonlinear AIMD algorithm
by: Y. Baryshnikov, et al.
Published: (2005-01-01)