Pages that link to "Item:Q794778"
From MaRDI portal
The following pages link to Some algorithms on the star operation applied to finite languages (Q794778):
Displaying 8 items.
- A characterization of s-languages (Q1029050) (← links)
- Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson (Q1063697) (← links)
- Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht (Q1087020) (← links)
- On the defect theorem and simplifiability (Q1090421) (← links)
- A characterization of rational star languages generated by strong codes (Q1092172) (← links)
- The homomorphism problem for trace monoids. (Q1426045) (← links)
- Algorithmic ways of deciding whether an infinite language is a code (Q1912449) (← links)
- Characterization of Star-Connected Languages Using Finite Automata (Q3540123) (← links)