✦ LIBER ✦

On the complexity of computing the profinite closure of a rational language

✍ Scribed by P.-C. Héam

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the time complexity of tran

✍ Joël Coffy 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On the computational complexity of graph

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the complexity of computing determina

✍ Erich Kaltofen; Gilles Villard 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 412 KB

On computing the transitive closure of a

✍ J. Eve; R. Kurki-Suonio 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 647 KB

On the complexity of the gradient of a r

✍ I. S. Sergeev 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 592 KB

The computational complexity of rational

✍ Thomas Demuynck 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 331 KB