✦ LIBER ✦

Finite-state ω-languages

✍ Scribed by Ludwig Staiger

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 842 KB
Volume: 27
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(83)90051-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Which finite monoids are syntactic monoi

Which finite monoids are syntactic monoids of rational ω-languages

✍ Phan Trung Huy; Igor Livotsky; Do Long Van 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Inference of finite-state transducers fr

Inference of finite-state transducers from regular languages

✍ Francisco Casacuberta; Enrique Vidal; David Picó 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Index sets for ω-languages

✍ Douglas Czenzer; Jeffrey B. Remmel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of au

Literal shuffle on ω-languages

✍ Tetsuo Moriya; Hideki Yamasaki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Projection lemmas for ω-languages

✍ Ludwig Staiger 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 611 KB

Language-theoretical representations of

Language-theoretical representations of ω-languages

✍ Hideki Yamasaki 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 924 KB