Recommendations
Cites work
- A note on \(\omega\)-regular languages
- Adherences of languages
- Codes and local constraints
- Decision problems forω-automata
- Finitely generated \(\omega\)-languages
- scientific article; zbMATH DE number 4039337 (Why is no real title available?)
- scientific article; zbMATH DE number 3707805 (Why is no real title available?)
- scientific article; zbMATH DE number 17550 (Why is no real title available?)
- scientific article; zbMATH DE number 3566723 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 3341983 (Why is no real title available?)
- Language-theoretical representations of \(\omega\)-languages
- On generators of rational \(\omega\)-power languages
- On infinitary finite length codes
- On ω-regular sets
Cited in
(10)- On generators of rational \(\omega\)-power languages
- On codes, -codes and -generators
- Completing circular codes in regular submonoids
- Completing prefix codes in submonoids.
- Codes which are minimal generators of languages of biinfinite words
- PREFIX-FREE ŁUKASIEWICZ LANGUAGES
- scientific article; zbMATH DE number 4088952 (Why is no real title available?)
- scientific article; zbMATH DE number 33206 (Why is no real title available?)
- scientific article; zbMATH DE number 1744267 (Why is no real title available?)
- One-relation languages and code generators
This page was built for publication: Prefix-free languages as \(\omega\)-generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751290)
