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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was done with partial support from FAPESP, CNPq and BID/USP.
Preview
Unable to display preview. Download preview PDF.
References
J. Almeida. On power varieties of semigroups. J. Algebra, 120:1–17, 1989.
J. Almeida. Implicit operations on finite \(\mathcal{J}\)-trivial semigroups and a conjecture of I. Simon. J. Pure Appl. Algebra, 69:205–218, 1990.
J. Almeida. Semigrupos Finitos e álgebra Universal. IME-USP, SÃo Paulo, 1992. in Portuguese.
C. J. Ash. Pseudovarieties, generalized varieties and similarly described classes. J. Algebra, 92:104–115, 1985.
J. A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci., 16:37–55, 1978.
J. A. Brzozowski and I. Simon. Characterizations of locally testable events. Discrete Math., 4:243–271, 1973.
J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66–92, 1960.
R. S. Cohen and J. A. Brzozowski. Dot-depth of star-free events. J. Comput. Syst. Sci., 5:1–15, 1971.
S. Eilenberg. Automata, Languages, and Machines, Volume A. Academic Press, New York, 1974.
S. Eilenberg. Automata, Languages, and Machines, Volume B. Academic Press, New York, 1976.
C. C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21–52, 1961.
K. Hashiguchi. A decision procedure for the order of regular events. Theoretical Comput. Sci., 8:69–72, 1979.
K. Hashiguchi. Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci., 24:233–244, 1982.
K. Hashiguchi. Representation theorems on regular languages. J. Comput. Syst. Sci., 27:101–115, 1983.
K. Hashiguchi. Algorithms for determining relative star height and star height. Information and Computation, 78:124–169, 1988.
K. Hashiguchi. Improved limitedness theorems on finite automata with distance functions. Theoretical Comput. Sci., 72, 1990.
S. C. Kleene. Representations of events in nerve nets and finite automata. In Shannon, editor, Automata Studies, pages 3–41. pup, princeton, 1956.
R. Knast. A semigroup characterization of dot-depth one languages. R.A.I.R.O. Informatique Théorique, 17:321–330, 1983.
R. Knast. Some theorems on graph congruences. R.A.I.R.O. Informatique Théorique, 17:331–342, 1983.
D. Krob. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. of Algebra and Computation, 1993. in print.
H. Leung. On the topological structure of a finitely generated semigroup of matrices. Semigroup Forum, 37:273–287, 1988.
S. W. Margolis. On M-varieties generated by power monoids. Semigroup Forum, 22:339–353, 1981.
S. W. Margolis and J.-E. Pin. Minimal noncommutative varieties and power varieties. Pacific J. Math., 111:125–135, 1984.
S. W. Margolis and J.-E. Pin. Power monoids and finite \(\mathcal{J}\)-trivial monoids. Semigroup Forum, 29:99–108, 1984.
R. McNaughton. Symbolic logic for automata. Technical Report Tech. Note No. 60-244, Wright Air Development Division, Cincinnati, Ohio, 1960.
R. McNaughton. Algebraic decision procedures for local testability. Math. Syst. Theor., 8:60–76, 1974.
R. McNaughton and S. Papert. Counter-Free Automata. The M.I.T. Press, Cambridge, Mass., 1971.
D. Perrin and J.-E. Pin. First-order logic and star-free sets. J. Comput. Syst. Sci., 32:393–406, 1986.
J.-E. Pin. Hiérarchies de cocaténation. R.A.I.R.O. Informatique Théorique, 18:23–46, 1984.
J.-E. Pin. Semigroupe des parties et relations de Green. Can. J. Math, 36:327–343, 1984.
J.-E. Pin. Variétés de Langages Formels. Masson, Paris, 1984. English translation: Varieties of Formal Languages, Plenum, 1986.
J.-E. Pin and H. Straubing. Monoids of upper triangular matrices. In Colloquia Mathematica Societatis Janos Bolyai, 39, Semigroups, pages 259–272, Szeged, 1981.
J. Reiterman. The Birkhoff theorem for finite algebras. Alg. Univ., 14:1–10, 1982.
C. Reutenauer. Sur les variétés de langages et de monoÏdes. In GI 79, pages 260–265, Berlin, 1979. Springer-Verlag. Lecture Notes in Computer Science, 67.
J. Sakarovitch and I. Simon. Subwords. In M. Lothaire, editor, Combinatorics on Words, pages 105–144. Addison-Wesley, Reading, MA, 1983. Encyclopaedia of Mathematics, volume 17.
M. P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190–194, 1965.
M. P. Schützenberger. Sur certaines variétés de monoÏdes finis. In E. R. Caianello, editor, Automata Theory, pages 314–319. Academic Press, 1966.
I. Simon. Hierarchies of Events with Dot-Depth One. PhD thesis, University of Waterloo, Waterloo, Ont., Canada, 1972. Department of Applied Analysis and Computer Science.
I. Simon. Piecewise testable events. In H. Brakhage, editor, Automata Theory and Formal Languages, 2nd GI Conference, pages 214–222, Berlin, 1975. Springer-Verlag. Lecture Notes in Computer Science, 33.
I. Simon. Limited subsets of a free monoid. In Proc. 19th Annual Symposium on Foundations of Computer Science, pages 143–150, Piscataway, N.J., 1978. Institute of Electrical and Electronics Engineers.
I. Simon. Recognizable sets with multiplicities in the tropical semiring. In M. P. Chytil, L. Janiga, and V. Koubek, editors, Mathematical Foundations of Computer Science 1988, pages 107–120, Berlin, 1988. Springer-Verlag. Lecture Notes in Computer Science, 324.
I. Simon. On semigroups of matrices over the tropical semiring. Technical Report RT-MAC-8907, Departamento de CiÊncia da ComputaÇÃo do IME-USP, SÃo Paulo, 1989.
I. Simon. Factorization forests of finite height. Theoretical Comput. Sci., 72:65–94, 1990.
J. Stern. Characterizations of some classes of regular events. Theoretical Comput. Sci., 35:17–42, 1985.
H. Straubing. Recognizable sets and power sets of finite semigroups. Semigroup Forum, 18:331–340, 1979.
H. Straubing. A generalization of the Schützenberger product of finite monoids. Theoretical Comput. Sci., 13:137–150, 1981.
H. Straubing. Finite semigroup varieties of the form V*D. J. Pure Appl. Algebra, 36:53–94, 1985.
H. Straubing. Semigroups and languages of dot-depth two. Theoretical Comput. Sci., 58:361–378, 1988.
H. Straubing and D. Thérien. Partially ordered finite monoids and a theorem of I. Simon. J. Algebra, 119:393–399, 1988.
H. Straubing and P. Weil. On a conjecture concerning dot-depth two languages. Theoretical Comput. Sci., 104:161–183, 1992.
W. Thomas. Classifying regular events in symbolic logic. J. Comput. Syst. Sci., 25:360–376, 1982.
W. Thomas. An application of the Ehrenfeucht-Fraissé game in formal language theory. Soc. Math. France, 2e série, 16:11–21, 1984.
W. Thomas. A concatenation game and the dot-depth hierarchy. In Computation Theory and Logic, pages 415–426, Berlin, 1987. Springer-Verlag. Lecture Notes in Computer Science, 270.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, chapter 4, pages 133–191. Elsevier, elsevierp, 1990.
B. Tilson. Categories as algebra: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra, 48:83–198, 1987.
B. A. Trakhtenbrot. Synthesis of logic networks whose operators are described by means of single-place predicate calculus. Doklady Akad. Nauk. SSSR, 118:646–649, 1958. in russian.
A. Weber. Exponential upper and lower bounds for the order of a regular language. Technical report, Fachbereich Informatik, Johann Wolfgang Goethe-Universitä, Frankfurt, 1992.
P. Weil. Inverse monoids of dot-depth two. Theoretical Comput. Sci., 66:233–245, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-56939-1_92
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive