247 research outputs found

    Syntactic Monoids in a Category

    Get PDF
    The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott (D = sets), the syntactic semirings of Polak (D = semilattices), and the syntactic associative algebras of Reutenauer (D = vector spaces). Assuming that D is an entropic variety of algebras, we prove that the syntactic D-monoid of a language L can be constructed as a quotient of a free D-monoid modulo the syntactic congruence of L, and that it is isomorphic to the transition D-monoid of the minimal automaton for L in D. Furthermore, in case the variety D is locally finite, we characterize the regular languages as precisely the languages with finite syntactic D-monoids

    Weighted Automata and Monadic Second Order Logic

    Full text link
    Let S be a commutative semiring. M. Droste and P. Gastin have introduced in 2005 weighted monadic second order logic WMSOL with weights in S. They use a syntactic fragment RMSOL of WMSOL to characterize word functions (power series) recognizable by weighted automata, where the semantics of quantifiers is used both as arithmetical operations and, in the boolean case, as quantification. Already in 2001, B. Courcelle, J.Makowsky and U. Rotics have introduced a formalism for graph parameters definable in Monadic Second order Logic, here called MSOLEVAL with values in a ring R. Their framework can be easily adapted to semirings S. This formalism clearly separates the logical part from the arithmetical part and also applies to word functions. In this paper we give two proofs that RMSOL and MSOLEVAL with values in S have the same expressive power over words. One proof shows directly that MSOLEVAL captures the functions recognizable by weighted automata. The other proof shows how to translate the formalisms from one into the other.Comment: In Proceedings GandALF 2013, arXiv:1307.416

    Sound and complete axiomatizations of coalgebraic language equivalence

    Get PDF
    Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalised powerset construction that determinises coalgebras. We show that soundness and completeness are established by proving that expressions modulo axioms of a calculus form the rational fixpoint of the given type functor. Our main result is that the rational fixpoint of the functor FTFT, where TT is a monad describing the branching of the systems (e.g. non-determinism, weights, probability etc.), has as a quotient the rational fixpoint of the "determinised" type functor Fˉ\bar F, a lifting of FF to the category of TT-algebras. We apply our framework to the concrete example of weighted automata, for which we present a new sound and complete calculus for weighted language equivalence. As a special case, we obtain non-deterministic automata, where we recover Rabinovich's sound and complete calculus for language equivalence.Comment: Corrected version of published journal articl

    On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)

    Full text link
    Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular languages with classes of more complex algebraic objects. Such generalized varieties also have natural counterparts formed by classes of finite automata equipped with a certain additional algebraic structure. In this survey, we overview several variants of such varieties of enriched automata.Comment: In Proceedings AFL 2014, arXiv:1405.527

    On varieties of meet automata

    Get PDF
    AbstractEilenberg’s variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between conjunctive varieties of languages and varieties of semiring homomorphisms. In this paper, we add a third component to this result by considering varieties of meet automata. We consider three significant classes of languages, two of them consisting of reversible languages. We present conditions on meet automata and identities for semiring homomorphisms for their characterization

    A Categorical Approach to Syntactic Monoids

    Full text link
    The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D\mathcal D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott (D=\mathcal D= sets), the syntactic ordered monoids of Pin (D=\mathcal D = posets), the syntactic semirings of Pol\'ak (D=\mathcal D= semilattices), and the syntactic associative algebras of Reutenauer (D\mathcal D = vector spaces). Assuming that D\mathcal D is a commutative variety of algebras or ordered algebras, we prove that the syntactic D\mathcal D-monoid of a language LL can be constructed as a quotient of a free D\mathcal D-monoid modulo the syntactic congruence of LL, and that it is isomorphic to the transition D\mathcal D-monoid of the minimal automaton for LL in D\mathcal D. Furthermore, in the case where the variety D\mathcal D is locally finite, we characterize the regular languages as precisely the languages with finite syntactic D\mathcal D-monoids.Comment: arXiv admin note: substantial text overlap with arXiv:1504.0269

    Automata Minimization: a Functorial Approach

    Full text link
    In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type of outputs. Our results are as follows: A) We provide sufficient conditions on the output category so that minimization of the corresponding automata is guaranteed. B) We show how to lift adjunctions between the categories for output values to adjunctions between categories of automata. C) We show how this framework can be instantiated to unify several phenomena in automata theory, starting with determinization, minimization and syntactic algebras. We provide explanations of Choffrut's minimization algorithm for subsequential transducers and of Brzozowski's minimization algorithm in this setting.Comment: journal version of the CALCO 2017 paper arXiv:1711.0306

    Stream Differential Equations: Specification Formats and Solution Methods

    Get PDF
    Streams, or innite sequences, are innite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream dierential equations are a coinductive method for specifying streams and stream operations, and their theory has been developed in many papers over the past two decades. In this paper we present a survey of the many results in this area. Our focus is on the classication of dierent formats of stream dierential equations, their solution methods, and the classes of streams they can dene. Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS
    • …
    corecore