✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 5556 || Equations Defining the Polynomial Closure of a Lattice of Regular Languages

✍ Scribed by Albers, Susanne; Marchetti-Spaccamela, Alberto; Matias, Yossi; Nikoletseas, Sotiris; Thomas, Wolfgang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

✍ Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólf 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 350 KB

[Lecture Notes in Computer Science] Auto

✍ Loeckx, J. 📂 Article 📅 1974 ⚖ 785 KB

[Lecture Notes in Computer Science] Auto

✍ Fülöp, Zoltán; Gécseg, Ferenc 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 701 KB

[Lecture Notes in Computer Science] Auto

✍ Larsen, Kim G.; Skyum, Sven; Winskel, Glynn 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 626 KB

[Lecture Notes in Computer Science] Auto

✍ Lepistö, Timo; Salomaa, Arto 📂 Article 📅 1988 🏛 Springer Berlin Heidelberg ⚖ 823 KB

[Lecture Notes in Computer Science] Auto

✍ Ottmann, Thomas 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 956 KB