License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2008.1754
URN: urn:nbn:de:0030-drops-17544
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1754/
Gulan, Stefan ;
Fernau, Henning
An Optimal Construction of Finite Automata from Regular Expressions
Abstract
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression\'s structure.
Each intermediate graph represents an extended finite automaton accepting the same language. The character of our construction allows a fine-grained analysis of the
emerging automaton\'s size, eventually leading to an optimality result.
BibTeX - Entry
@InProceedings{gulan_et_al:LIPIcs:2008:1754,
author = {Stefan Gulan and Henning Fernau},
title = {{An Optimal Construction of Finite Automata from Regular Expressions}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
pages = {211--222},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-08-8},
ISSN = {1868-8969},
year = {2008},
volume = {2},
editor = {Ramesh Hariharan and Madhavan Mukund and V Vinay},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1754},
URN = {urn:nbn:de:0030-drops-17544},
doi = {10.4230/LIPIcs.FSTTCS.2008.1754},
annote = {Keywords: Finite automata,regular expressions,descriptional complexity}
}
|
Keywords: |
|
Finite automata,regular expressions,descriptional complexity |
|
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science |
|
Issue Date: |
|
2008 |
|
Date of publication: |
|
05.12.2008 |
