Downloads provided by UsageCounts
<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>doi: 10.3897/jucs.66330
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having at most 3 states more than the length of the REwLA. We also investigate the state complexity when translating REwLA to equivalent deterministic finite automata (DFA).
Datavetenskap (datalogi), Computer Sciences, Electronic computers. Computer science, Boolea, QA75.5-76.95, Regular expressions, Lookahead expressions, Boolean automata
Datavetenskap (datalogi), Computer Sciences, Electronic computers. Computer science, Boolea, QA75.5-76.95, Regular expressions, Lookahead expressions, Boolean automata
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
| views | 12 | |
| downloads | 8 |

Views provided by UsageCounts
Downloads provided by UsageCounts