LIPIcs.FSTTCS.2008.1754.pdf
- Filesize: 443 kB
- 12 pages
Document
An Optimal Construction of Finite Automata from Regular Expressions
Authors
-
Part of:
Volume:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2008-12-05
Cite AsGet BibTex
Stefan Gulan and Henning Fernau. An Optimal Construction of Finite Automata from Regular Expressions. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 211-222, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1754
https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1754
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.
Keywords
- Finite automata,regular expressions,descriptional complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads