Some algorithms on the star operation applied to finite languages

DOI10.1007/BF02572484zbMath0541.20044MaRDI QIDQ794778

Jorge Almeida

Publication date: 1984

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

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

zbMATH Keywords

directed graphfree semigroupfree monoidfinite languageC-loopsinfinite sequence of languagessynchronizing codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht ⋮ On the defect theorem and simplifiability ⋮ The homomorphism problem for trace monoids.

Cites Work

• Sur le théorème du defaut
• Presentations et presentations simplifiables d'un monoide simplifiable
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• 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
• The Sardinas/Patterson and Levenshtein theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item