Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/96756| Author(s): | Hugo Gouveia Nelma Moreira Rogério Reis |
| Title: | Small nfas from regular expressions: Some experimental results |
| Issue Date: | 2010 |
| Abstract: | Regular expressions (RES), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recognition depend on the size of the equivalent nondeterministic finite automata (NFA). We present the implementation of several algorithms for constructing small epsilon-free NFAs from RES within the FAdo system, and a comparison of regular expression measures and NFA sizes based on experimental results obtained from uniform random generated RES. For this analysis, nonredundant RES and reduced RES in star normal form were considered. |
| Subject: | Ciência de computadores, Ciências da computação e da informação Computer science, Computer and information sciences |
| Scientific areas: | Ciências exactas e naturais::Ciências da computação e da informação Natural sciences::Computer and information sciences |
| URI: | https://hdl.handle.net/10216/96756 |
| Source: | Proceedings of 6th Conference on Computability in Europe |
| Document Type: | Artigo em Livro de Atas de Conferência Internacional |
| Rights: | restrictedAccess |
| Appears in Collections: | FCUP - Artigo em Livro de Atas de Conferência Internacional |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 48395.pdf Restricted Access | Artigo | 540.74 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.