Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).

Jean-Marc Champarnaud Jean-Philippe Dubernard Hadrien Jeanne Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). 68-77 2008 CIAA http://dx.doi.org/10.1007/978-3-540-70844-5_8 conf/wia/2008 db/conf/wia/ciaa2008.html#ChamparnaudDJ08