✦ LIBER ✦

Minimizing nfa's and regular expressions

✍ Scribed by Gregor Gramlich; Georg Schnitger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] STAC

✍ Diekert, Volker; Durand, Bruno 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 201 KB

[Lecture Notes in Computer Science] STAC

✍ Diekert, Volker; Durand, Bruno 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 201 KB

From regular expressions to smaller NFAs

✍ Pedro García; Damián López; José Ruiz; Gloria I. Álvarez 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Fast, memory-efficient regular expressio

✍ Liu Yang; Rezwana Karim; Vinod Ganapathy; Randy Smith 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 691 KB

GPU-based NFA implementation for memory

✍ Zu, Yuan; Yang, Ming; Xu, Zhonghu; Wang, Lin; Tian, Xin; Peng, Kunyang; Dong, Qu 📂 Article 📅 2012 🏛 Association for Computing Machinery ⚖ 749 KB

On regular expressions and regular canon

✍ Arto Salomaa 📂 Article 📅 1968 🏛 Springer 🌐 English ⚖ 849 KB