333 research outputs found

    Recognizing pro-R closures of regular languages

    Full text link
    Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite R-trivial semigroups. In particular, we obtain a new effective solution of the separation problem of regular languages by R-languages

    Adding modular predicates to first-order fragments

    Full text link
    We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which successfully covers the quantifier alternation hierarchy of first order logic and some of its fragments. We obtain that deciding this problem for each level of the alternation hierarchy of both first order logic and its two-variable fragment when equipped with all regular numerical predicates is not harder than deciding it for the corresponding level equipped with only the linear order and the successor. For two-variable fragments we also treat the case of the signature containing only the order and modular predicates.Relying on some recent results, this proves the decidability for each level of the alternation hierarchy of the two-variable first order fragmentwhile in the case of the first order logic the question remains open for levels greater than two.The main ingredients of the proofs are syntactic transformations of first order formulas as well as the algebraic framework of finite categories

    Eilenberg Theorems for Free

    Get PDF
    Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory. Numerous such correspondences are known in the literature. We demonstrate that they all arise from the same recipe: one models languages and the algebras recognizing them by monads on an algebraic category, and applies a Stone-type duality. Our main contribution is a variety theorem that covers e.g. Wilke's and Pin's work on ∞\infty-languages, the variety theorem for cost functions of Daviaud, Kuperberg, and Pin, and unifies the two previous categorical approaches of Boja\'nczyk and of Ad\'amek et al. In addition we derive a number of new results, including an extension of the local variety theorem of Gehrke, Grigorieff, and Pin from finite to infinite words

    On the group of a rational maximal bifix code

    Full text link
    We give necessary and sufficient conditions for the group of a rational maximal bifix code ZZ to be isomorphic with the FF-group of Z∩FZ\cap F, when FF is recurrent and Z∩FZ\cap F is rational. The case where FF is uniformly recurrent, which is known to imply the finiteness of Z∩FZ\cap F, receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of FF

    Regular Cost Functions, Part I: Logic and Algebra over Words

    Full text link
    The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the two values "inside" and "outside". This theory is a continuation of the works on distance automata and similar models. These models of automata have been successfully used for solving the star-height problem, the finite power property, the finite substitution problem, the relative inclusion star-height problem and the boundedness problem for monadic-second order logic over words. Our notion of regularity can be -- as in the classical theory of regular languages -- equivalently defined in terms of automata, expressions, algebraic recognisability, and by a variant of the monadic second-order logic. These equivalences are strict extensions of the corresponding classical results. The present paper introduces the cost monadic logic, the quantitative extension to the notion of monadic second-order logic we use, and show that some problems of existence of bounds are decidable for this logic. This is achieved by introducing the corresponding algebraic formalism: stabilisation monoids.Comment: 47 page
    • …
    corecore