Abstract
The relation between the theory of finite monoids and the theory of rational languages is a well-known fact since Kleene’s Theorem (1954), and it was studied in the works of Schützenberger, Rhodes and Eilenberg, among others.
This work was supported by the “P.R.C. Mathématique et Informatique”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Eilenberg. Automata, Languages and Machines, vol.B, Academic Press (New York), 1976.
S. Kleene. Representation of events in nerve nets and finite automata, in Automata Studies (Shannon and McCarthy eds.), Princeton University Press, (Princeton) 1954, pp.3-51.
G. Lallement. Semigroups and Combinatorial Applications, Wiley (New York), 1979.
J.-E. Pin. Concatenation hierarchies and decidability results, in Combinatorics on Words, Progress and Perspectives (L.Cummings ed.), Academic Press, 1983, pp. 195-228.
J.-E. Pin. Variétés de langages formels, Masson (Paris), 1984, and Varieties of formal languages, North Oxford Academic (London), 1986 and Plenum (New York), 1986.
J.-E. Pin. Finite group topology and p-adic topology for free monoids, in 12th ICALP, Lecture Notes in Computer Science 194, Springer (1985), pp.445-455.
J.-E. Pin. Topologies for the free monoid, to appear in Journal of Algebra.
Ch. Reutenauer. Sur les variétés de languages et de monoides, in Theoretical Computer Science 4th GI Conference, Lecture Notes in Computer Science 67, Springer (1979), pp.260-265.
M.-P. Schützenberger. On finite monoids having only trivial subgroups, in Information and Control 8 (1965), pp.190–194.
L Simon. Piecewise testable events, in Proc. 2nd G.I. Conf, Lecture Notes in Computer Science 33, Springer (1975), pp. 214–222.
H. Straubing. Recognizable sets and power sets of finite semigroups, in Semigroup Forum 18 (1979), pp.331–340.
H. Straubing. A generalization of the Schützenberger product of finite monoids, in Theoretical Computer Science 13 (1981), pp. 137–150.
H. Straubing, D. Thérien and W. Thomas. Regular languages defined with generalized quantifiers, to appear.
D. Thérien. Languages of nilpotent and solvable groups, in Proc. 6th I.C.A.L.P., Lecture Notes in Computer Science 71, Springer, Berlin (1979), pp.616–632.
D. Thérien. Classification of finite monoids: the language approach, in Theoretical Computer Science 14 (1981), pp.195–208.
P. Weil. Products of languages with counter, to appear in Theoretical Computer Science.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer Science+Business Media New York
About this chapter
Cite this chapter
Weil, P. (1990). An Extension of the Schützenberger Product. In: Almeida, J., Bordalo, G., Dwinger, P. (eds) Lattices, Semigroups, and Universal Algebra. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-2608-1_31
Download citation
DOI: https://doi.org/10.1007/978-1-4899-2608-1_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-2610-4
Online ISBN: 978-1-4899-2608-1
eBook Packages: Springer Book Archive