The product of rational languages

  • Imre Simon
Conference paper

DOI: 10.1007/3-540-56939-1_92

Part of the Lecture Notes in Computer Science book series (LNCS, volume 700)
Cite this paper as:
Simon I. (1993) The product of rational languages. In: Lingas A., Karlsson R., Carlsson S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg

Abstract

The very basic operation of the product of rational languages is the source of some of the most fertilizing problems in the Theory of Finite Automata. Indeed, attempts to solve McNaughton's star-free problem, Eggan's star-height problem and Brzozowski's dot-depth problem, all three related to the product, already led to many deep and ever expanding connections between the Theory of Finite Automata and other parts of Mathematics, such as Combinatorics, Algebra, Topology, Logic and even Universal Algebra. We review some of the most significant results of the area, obtained during the last 35 years, and try to show their contribution to our understanding of the product.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Imre Simon
    • 1
  1. 1.Instituto de Matemática e EstatísticaUniversidade de SÃo PauloSÃo PauloSP, Brasil

Personalised recommendations