@inbook{Ilie2004,
Abstract = {We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We develop restricted reduction algorithms that operate on position automata while preserving some of its properties. We show empirically that these reductions are effective in largely reducing the memory requirements of regular expression search algorithms, and compare the effectiveness of different reductions.},
Address = {Berlin, Heidelberg},
Author = {Ilie, Lucian and Navarro, Gonzalo and Yu, Sheng},
BookTitle = {Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday},
Editor = {Karhum{\"a}ki, Juhani and Maurer, Hermann and P{\u{a}}un, Gheorghe and Rozenberg, Grzegorz},
File = {05c8bd5bd6b8cfed9b99362b25116702b0f2 (0) - a - a - q.pdf},
ISBN = {978-3-540-27812-2},
Pages = {112--124},
Publisher = {Springer Berlin Heidelberg},
Title = {On NFA Reductions},
URL = {https://doi.org/10.1007/978-3-540-27812-2\_11},
Year = {2004},
bdsk-url-1 = {https://doi.org/10.1007/978-3-540-27812-2\_11},
bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-540-27812-2\_11},
date-added = {2017-11-02 08:16:31 +0000},
date-modified = {2017-11-02 08:16:31 +0000},
doi = {10.1007/978-3-540-27812-2_11}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A