4 citations · 4 across the 2 of their papers we have counts for
1 paper · 1 filter
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…