Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1995)
Grille t, Semigroups, An Introduction to the Structure Theory, Marce1
Howard Straubing (2002)
On Logical Descriptions of Regular Languages
P. Weil (1990)
An Extension of the Schützenberger Product
(1986)
Finite subformations of varieties of algebraic systems
(1997)
Syntactic semigroups, in Handbook of formal languages
(2006)
Classes of Finite Groups, Mathematics and Its Applications 584
(1984)
Shemetkov, Product of formations of algebraic systems, Algebra Logic
J. Pin (1995)
A variety theorem without complementation
K. Auinger, B. Steinberg (2006)
Varieties of finite supersolvable groups with the M. Hall propertyMathematische Annalen, 335
D. Thérien (1983)
SUBWORD COUNTING AND NILPOTENT GROUPS
(1986)
Finite Subformations of Varieties of Algebraic Systems (in Russian), Problems i n Algebra 2, "Universitet·skoe
J. Pin, Raymond Miller (1986)
Varieties of Formal Languages
(1983)
Subword counting and nilpotent groups, in: Combinatorics on Words (Waterloo 1982)
W. Gaschütz, Ursula Lubeseder (1963)
Kennzeichnung gesättigter FormationenMathematische Zeitschrift, 82
J. Ward (1969)
On Finite Soluble GroupsJournal of the Australian Mathematical Society, 9
and X . Soler - Escriva , Languages recognized by finite supersol - uble groups
K. Auinger, B. Steinberg (2005)
On power groups and embedding theorems for relatively free profinite monoidsMathematical Proceedings of the Cambridge Philosophical Society, 138
M. Schützenberger (1965)
On Finite Monoids Having Only Trivial SubgroupsInf. Control., 8
(1963)
Math. Z
(1989)
Formations of algebraic systems
(2006)
Classes of finite groups, Mathematics and Its Applications
P. Weil (1990)
Products of Languages with CounterTheor. Comput. Sci., 76
W. Guo, K. Shum (2002)
FORMATION OPERATORS ON CLASSES OF ALGEBRASCommunications in Algebra, 30
Howard Straubing (1979)
Families of recognizable sets corresponding to certain varieties of finite monoidsJournal of Pure and Applied Algebra, 15
(2002)
Varieties of languages, in: Semigroups, Algorithms, Automata and Languages (Coimbra 200 I)
K. Auinger, B. Steinberg (2003)
The geometry of profinite graphs with applications to free groups and finite monoidsTransactions of the American Mathematical Society, 356
J. Pin (1997)
Syntactic Semigroups
L. Shemetkov (1984)
Product of formations of algebraic systemsAlgebra and Logic, 23
(2001)
Varieties of languages, in Semigroups, algorithms, automata and languages (Coimbra
Olivier Carton, J. Pin, X. Soler-Escrivà (2009)
Languages Recognized by Finite Supersoluble GroupsJ. Autom. Lang. Comb., 14
A. Ballester-Bolinches, J. Pin, X. Soler-Escrivà (2015)
Languages associated with saturated formations of groupsForum Mathematicum, 27
M. Branco (2002)
VARIETIES OF LANGUAGES
P. Grillet (1995)
Semigroups: An Introduction to the Structure Theory
(1986)
Varieties of Formal Languages, North Oxford, London, and Plenum
(1997)
Syntactic semigroups, in: Handbook of Formal Languages, Volume I
B. Steinberg (2002)
Inverse automata and profinite topologies on a free groupJournal of Pure and Applied Algebra, 167
Z. Ésik, Masami Ito (2001)
Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite AutomataActa Cybern., 16
J. Pin (2009)
Profinite Methods in Automata Theory
S. Eilenberg (1974)
Automata, languages, and machines. A
(1989)
Formations of algebraic systems. (Formatsii algebraicheskikh sistem.), Sovremenna Algebra. [Modern Algebra], Sovremennaya Algebra
A. Ballester-Bolinches, L. Marín (2006)
Classes of finite groups
K. Auinger, B. Steinberg (2005)
Constructing divisions into power groupsTheor. Comput. Sci., 341
Imre Simon (1975)
Piecewise testable events
(1986)
Finite subformations of varieties of algebraic systems, in Problems in algebra
M. Gehrke, S. Grigorieff, J. Pin (2008)
Duality and Equational Theory of Regular Languages
Berndt Müller (2001)
omega-Automata
(1989)
Formations of Algebraic Systems (in R ussian)
Abstract We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to formal languages. We prove that there is a bijective correspondence between formations of finite monoids and certain classes of languages, the formations of languages. Our result permits to treat classes of finite monoids which are not necessarily closed under taking submonoids, contrary to the original theory. We also prove a similar result for ordered monoids.
Forum Mathematicum – de Gruyter
Published: Nov 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.