Finitely generated \(\omega\)-languages
From MaRDI portal
Publication:1092671
DOI10.1016/0020-0190(86)90131-6zbMath0627.68059MaRDI QIDQ1092671
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90131-6
68Q45: Formal languages and automata
Related Items
Prefix-free languages as \(\omega\)-generators, On generators of rational \(\omega\)-power languages, Finitely generated bi\(\omega\)-languages, Completing circular codes in regular submonoids, Completing prefix codes in submonoids., Rebootable and suffix-closed $\omega $-power languages
Cites Work