✦ LIBER ✦

Representability of nonregular languages in finite probabilistic automata

✍ Scribed by Robert Knast

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Languages Representable by Finite

✍ Phan Dinh Diêu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 837 KB

Concise representations of regular langu

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

Comparative complexity of the representa

✍ F. M. Ablaev 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 537 KB

Projections of languages recognizable by

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

Criteria for the representation of event

✍ R. G. Bukharaev 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 759 KB

Representations of finite automata

✍ I. S. Grunskii 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 778 KB