Conversion of regular expressions into realtime automata
From MaRDI portal
Publication:3423141
DOI10.1051/ita:2006036zbMath1110.68063OpenAlexW2047416274MaRDI QIDQ3423141
L'Ubomíra Ištoňová, Viliam Geffert
Publication date: 20 February 2007
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_4_611_0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression
- Complexity measures for regular expressions
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata