Advertisement

Syntactic Semiring and Universal Automaton

  • Libor Polák
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2710)

Abstract

We discuss the relationships between the minimal automaton, the universal automaton, the syntactic monoid and the syntactic semiring of a given regular language. We use certain completions and reductions of the transformation matrix of the minimal automaton to clarify those connections.

Keywords

syntactic semiring universal automaton 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, Ltd., 1971Google Scholar
  2. 2.
    S. Lombardy, On the construction of reversible automata for reversible languages, ICALP, Springer Lecture Notes in Computer Science, Vol. 2380, pp. 170–182, 2002Google Scholar
  3. 3.
    S. Lombardy and J. Sakarovitch, On the star height of rational languages. A new presentation for two old results, Proc. 3rd Int. Col. on Words, Languages and Combinatorics, World Scientific, to appearGoogle Scholar
  4. 4.
    S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata LATIN, Springer Lecture Notes in Computer Science, Vol. 2286, pp. 76–90, 2002Google Scholar
  5. 5.
    J.-E. Pin, Syntactic semigroups, Chapter 10 in Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds, Springer, 1997Google Scholar
  6. 6.
    L. Polák, A classification of rational languages by semilattice-ordered monoids, submitted, see also http://www.math.muni.cz/~polakGoogle Scholar
  7. 7.
    L. Polák, Syntactic semiring of a language, Proc. Mathematical Foundations of Computer Science 2001, Springer Lecture Notes in Computer Science, Vol. 2136, 2001, pages 611–620CrossRefGoogle Scholar
  8. 8.
    L. Polák, Syntactic Semiring and Language Equations, in Proc. of the Seventh International Conference on Implementation and Application of Automata, Tours 2002, Springer Lecture Notes in Computer Science, to appearGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Libor Polák
    • 1
  1. 1.Department of MathematicsMasaryk UniversityBrnoCzech Republic

Personalised recommendations