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.
Cite
CITATION STYLE
Simon, I. (1993). The product of rational languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 430–444). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
