Some algorithms on the star operation applied to finite languages

DOI10.1007/BF02572484MaRDI QIDQ794778zbMATH OpenFDO

Authors 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 monoidfree semigroupfinite 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)

Recommendations

• Algorithmic ways of deciding whether an infinite language is a code
• Free submonoids in the monoid of languages
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• scientific article; zbMATH DE number 3932413
• scientific article; zbMATH DE number 3936538

Cites work

• scientific article; zbMATH DE number 3158348 (Why is no real title available?)
• scientific article; zbMATH DE number 3932413 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3202041 (Why is no real title available?)
• Free subsemigroups of a free semigroup
• On finitely generated subsemigroups of a free semigroup
• Presentations et presentations simplifiables d'un monoide simplifiable
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• Sur le théorème du defaut
• The Sardinas/Patterson and Levenshtein theorems
• The intersection of free submonoids of a free monoid is free

Cited in

(10)

• A characterization of rational star languages generated by strong codes
• Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht
• On the defect theorem and simplifiability
• A characterization of s-languages
• Characterization of Star-Connected Languages Using Finite Automata
• scientific article; zbMATH DE number 3970684 (Why is no real title available?)
• scientific article; zbMATH DE number 3932413 (Why is no real title available?)
• The homomorphism problem for trace monoids.
• scientific article; zbMATH DE number 3936538 (Why is no real title available?)
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson

This page was built for publication: Some algorithms on the star operation applied to finite languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794778)