Some algorithms on the star operation applied to finite languages
DOI10.1007/BF02572484zbMATH Open0541.20044MaRDI QIDQ794778FDOQ794778
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
Recommendations
directed graphfree monoidfree semigroupfinite languageC-loopsinfinite sequence of languagessynchronizing codes
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Sur le théorème du defaut
- On finitely generated subsemigroups of a free semigroup
- The intersection of free submonoids of a free monoid is free
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Sardinas/Patterson and Levenshtein theorems
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The homomorphism problem for trace monoids.
- Title not available (Why is that?)
- 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)
