✦ LIBER ✦

From regular expressions to smaller NFAs

✍ Scribed by Pedro García; Damián López; José Ruiz; Gloria I. Álvarez

Book ID: 113927442
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 316 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.058

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing nfa's and regular expressions

✍ Gregor Gramlich; Georg Schnitger 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Fast, memory-efficient regular expressio

Fast, memory-efficient regular expression matching with NFA-OBDDs

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

From regular expressions to deterministi

From regular expressions to deterministic automata

✍ Gerard Berry; Ravi Sethi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 593 KB

Regular Expressions from Sequential Circ

Regular Expressions from Sequential Circuits

✍ Brzozowski, J. A. 📂 Article 📅 1964 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 765 KB

GPU-based NFA implementation for memory

GPU-based NFA implementation for memory efficient high speed regular expression matching

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

A lower bound on the size of ε-free NFA

A lower bound on the size of ε-free NFA corresponding to a regular expression

✍ Yuri Lifshits 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 110 KB

Hromkovic et al. showed how to transform a regular expression of size n into an ε-free nondeterministic finite automaton (which defines the same language as the expression) with O(n) states and O(n log 2 (n)) transitions. They also established a lower bound (n log(n)) on the number of transitions. W