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, H. Jeanne. Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). In Oscar H. Ibarra, Bala Ravikumar, editors, Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings. Volume 5148 of Lecture Notes in Computer Science, pages 68-77, Springer, 2008. [doi]

Abstract

Abstract is missing.