Commutative images of rational languages and the Abelian kernel of a monoid

DOI10.1051/ita:2001100zbMath1028.68087OpenAlexW2165377501MaRDI QIDQ3149083

Manuel Delgado

Publication date: 26 January 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_5_419_0

zbMATH Keywords

algorithmsfinite monoidsrational languagesrational expressionscommutative imagessemilinear expressions

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS ⋮ Computing relative Abelian kernels of finite monoids. ⋮ TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS ⋮ Relative Abelian kernels of some classes of transformation monoids

Uses Software

• GAP
• MONOiD
• AMoRE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Complexity measures for regular expressions
• Abelian pointlikes of a monoid
• Abelian kernels of some monoids of injective partial transformations and an application
• Finite state automata: A geometric approach
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• A topological approach to a conjecture of Rhodes
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• A Conjecture on the Hall Topology for the Free Group
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• On The Profinite Topology on a Free Group
• Algorithms for computing finite semigroups
• Boolean Matrices and the Stability of Neural Nets