Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/90548
Author(s): | Nelma Moreira Nabais, D Rogério Reis |
Title: | State Elimination Ordering Strategies: Some Experimental Results |
Issue Date: | 2010 |
Abstract: | Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed. In this paper we analyse some of the heuris- tics presented in the literature and propose new ones. We also present some experimental comparative results based on uniform random gener- ated deterministic finite automata. |
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/90548 |
Source: | Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. |
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 | |
---|---|---|---|---|
48797.pdf Restricted Access | Artigo | 154.67 kB | Adobe PDF | Request a copy from the Author(s) |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.