✦ LIBER ✦

2 ω-finite automata and sets of obstructions of their languages

✍ Scribed by Melnikov, B. F.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ω-Languages accepted by finite automata

✍ Tetsuo Moriya 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 488 KB

On characteristic sets and degrees of fi

✍ Keisuke Tanatsugu; Setsuo Arikawa 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 411 KB

Projections of languages recognizable by

✍ Rūsinś Freivalds 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Concise representations of regular langu

✍ Chandra M. R. Kintala; Kong -Yee Pun; Detlef Wotschke 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 744 KB

The Hausdorff-Kuratowski hierarchy of ω-

✍ Rana Barua 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 932 KB

Families of finite sets containing nokdi

✍ P. Frankl 📂 Article 📅 1977 🏛 Springer Netherlands 🌐 English ⚖ 105 KB