Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre

DOI10.1007/BF02194863zbMath0298.20046OpenAlexW1996406426MaRDI QIDQ1214507

Jean-Claude Spehner

Publication date: 1974

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134090

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (16)

Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht ⋮ A bijection between cliques in graphs and factorizations in free monoids ⋮ On the defect theorem and simplifiability ⋮ Reidemeister-Schreier type rewriting for semigroups ⋮ Every finitely generated submonoid of a free monoid has a finite Malcev's presentation ⋮ Sur le théorème du defaut ⋮ On optimal factorization of free semigroups into free subsemigroups ⋮ Presentations et presentations simplifiables d'un monoide simplifiable ⋮ The homomorphism problem for trace monoids. ⋮ Closure systems and L-subalgebras ⋮ Computers in semigroups ⋮ On some free subsemigroups of a free semigroup ⋮ Sur la classification syntaxique ⋮ On codes with finite interpreting delay: a defect theorem ⋮ Some algorithms on the star operation applied to finite languages ⋮ Regular Gröbner bases

Cites Work

• Free subsemigroups of a free semigroup
• On finitely generated subsemigroups of a free semigroup
• The intersection of free submonoids of a free monoid is free
• On Subsemigroups of Free Semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre