8 research outputs found
Separation Property for wB- and wS-regular Languages
In this paper we show that {\omega}B- and {\omega}S-regular languages satisfy
the following separation-type theorem If L1,L2 are disjoint languages of
{\omega}-words both recognised by {\omega}B- (resp. {\omega}S)-automata then
there exists an {\omega}-regular language Lsep that contains L1, and whose
complement contains L2. In particular, if a language and its complement are
recognised by {\omega}B- (resp. {\omega}S)-automata then the language is
{\omega}-regular. The result is especially interesting because, as shown by
Boja\'nczyk and Colcombet, {\omega}B-regular languages are complements of
{\omega}S-regular languages. Therefore, the above theorem shows that these are
two mutually dual classes that both have the separation property. Usually (e.g.
in descriptive set theory or recursion theory) exactly one class from a pair C,
Cc has the separation property. The proof technique reduces the separation
property for {\omega}-word languages to profinite languages using Ramsey's
theorem and topological methods. After that reduction, the analysis of the
separation property in the profinite monoid is relatively simple. The whole
construction is technically not complicated, moreover it seems to be quite
extensible. The paper uses a framework for the analysis of B- and S-regular
languages in the context of the profinite monoid that was proposed by
Toru\'nczyk
Varieties of Cost Functions.
Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties. For instance, stabilisation monoids play the same role for cost functions as monoids do for regular languages. The purpose of this article is to further extend this algebraic approach by generalising two results on regular languages to cost functions: Eilenberg's varieties theorem and profinite equational characterisations of lattices of regular languages. This opens interesting new perspectives, but the specificities of cost functions introduce difficulties that prevent these generalisations to be straightforward. In contrast, although syntactic algebras can be defined for formal power series over a commutative ring, no such notion is known for series over semirings and in particular over the tropical semiring
Varieties of Cost Functions
Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties. For instance, stabilisation monoids play the same role for cost functions as monoids do for regular languages. The purpose of this article is to further extend this algebraic approach by generalising two results on regular languages to cost functions: Eilenberg\u27s varieties theorem and profinite equational characterisations of lattices of regular languages. This opens interesting new perspectives, but the specificities of cost functions introduce difficulties that prevent these generalisations to be straightforward. In contrast, although syntactic algebras can be defined for formal power series over a commutative ring, no such notion is known for series over semirings and in particular over the tropical semiring
Profinite Techniques for Probabilistic Automata and the Markov Monoid Algorithm
We consider the value 1 problem for probabilistic automata over finite words:
it asks whether a given probabilistic automaton accepts words with probability
arbitrarily close to 1. This problem is known to be undecidable. However,
different algorithms have been proposed to partially solve it; it has been
recently shown that the Markov Monoid algorithm, based on algebra, is the most
correct algorithm so far. The first contribution of this paper is to give a
characterisation of the Markov Monoid algorithm. The second contribution is to
develop a profinite theory for probabilistic automata, called the prostochastic
theory. This new framework gives a topological account of the value 1 problem,
which in this context is cast as an emptiness problem. The above
characterisation is reformulated using the prostochastic theory, allowing us to
give a simple and modular proof.Comment: Conference version: STACS'2016, Symposium on Theoretical Aspects of
Computer Science Journal version: TCS'2017, Theoretical Computer Scienc
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..