✦ LIBER ✦

COMPLEXITY IN UNION-FREE REGULAR LANGUAGES

✍ Scribed by JIRÁSKOVÁ, GALINA; MASOPUST, TOMÁŠ

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Deve

✍ Gao, Yuan; Lu, Hanlin; Seki, Shinnosuke; Yu, Sheng 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 237 KB

On Equations for Union-Free Regular Lang

✍ Siniša Crvenković; Igor Dolinka; Zoltán Ésik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Intersection and union of regular langua

✍ Jean-Camille Birget 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 363 KB

State complexity of union and intersecti

✍ Yuan Gao; Lila Kari; Sheng Yu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 318 KB

State complexity of star of union and sq

✍ Gao, Yuan; Kari, Lila 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Circuit Complexity of Regular Languages

✍ Michal Koucký 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 316 KB