1,377 research outputs found

    Logic Meets Algebra: the Case of Regular Languages

    Full text link
    The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical formalism required to define them. The algebraic point of view on automata is an essential complement of this classification: by providing alternative, algebraic characterizations for the classes, it often yields the only opportunity for the design of algorithms that decide expressibility in some logical fragment. We survey the existing results relating the expressibility of regular languages in logical fragments of MSO[S] with algebraic properties of their minimal automata. In particular, we show that many of the best known results in this area share the same underlying mechanics and rely on a very strong relation between logical substitutions and block-products of pseudovarieties of monoid. We also explain the impact of these connections on circuit complexity theory.Comment: 37 page

    Small overlap monoids II: automatic structures and normal forms

    Full text link
    We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular language of normal forms, and that these normal forms can be computed in linear time. We also deduce that C(4) monoids and semigroups are rational (in the sense of Sakarovitch), asynchronous automatic, and word hyperbolic (in the sense of Duncan and Gilman). From this it follows that C(4) monoids satisfy analogues of Kleene's theorem, and admit decision algorithms for the rational subset and finitely generated submonoid membership problems. We also prove some automata-theoretic results which may be of independent interest.Comment: 17 page

    Varieties of Restriction Semigroups and Varieties of Categories

    Get PDF
    The variety of restriction semigroups may be most simply described as that generated from inverse semigroups (S, ·, −1) by forgetting the inverse operation and retaining the two operations x+ = xx−1 and x* = x−1x. The subvariety B of strictrestriction semigroups is that generated by the Brandt semigroups. At the top of its lattice of subvarieties are the two intervals [B2, B2M = B] and [B0, B0M]. Here, B2and B0 are, respectively, generated by the five-element Brandt semigroup and that obtained by removing one of its nonidempotents. The other two varieties are their joins with the variety of all monoids. It is shown here that the interval [B2, B] is isomorphic to the lattice of varieties of categories, as introduced by Tilson in a seminal paper on this topic. Important concepts, such as the local and global varieties associated with monoids, are readily identified under this isomorphism. Two of Tilson\u27s major theorems have natural interpretations and application to the interval [B2, B] and, with modification, to the interval [B0, B0M] that lies below it. Further exploration may lead to applications in the reverse direction

    The FO^2 alternation hierarchy is decidable

    Get PDF
    We consider the two-variable fragment FO^2[<] of first-order logic over finite words. Numerous characterizations of this class are known. Th\'erien and Wilke have shown that it is decidable whether a given regular language is definable in FO^2[<]. From a practical point of view, as shown by Weis, FO^2[<] is interesting since its satisfiability problem is in NP. Restricting the number of quantifier alternations yields an infinite hierarchy inside the class of FO^2[<]-definable languages. We show that each level of this hierarchy is decidable. For this purpose, we relate each level of the hierarchy with a decidable variety of finite monoids. Our result implies that there are many different ways of climbing up the FO^2[<]-quantifier alternation hierarchy: deterministic and co-deterministic products, Mal'cev products with definite and reverse definite semigroups, iterated block products with J-trivial monoids, and some inductively defined omega-term identities. A combinatorial tool in the process of ascension is that of condensed rankers, a refinement of the rankers of Weis and Immerman and the turtle programs of Schwentick, Th\'erien, and Vollmer
    • …
    corecore