13 citations · 17 across the 5 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.FL2013
Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton…
cs.FL2013★ 4 cited
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne +1
The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as n…