Author:
Champarnaud J.-M.,Coulon F.
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. J. Amilhastre, P. Janssen, M.C. Vilarem, FA minimization heuristics for a class of finite languages, in: O. Boldt, H. Jürgensen (Eds.), Automata Implementation, WIA'99, Lecture Notes in Computer Science, Vol. 2214, Springer, Berlin, 2001, pp. 1–12.
2. Rewriting regular inequalities;Antimirov;Lecture Notes in Comput. Sci.,1995
3. Canonical regular expressions and minimal state graphs for definite events;Brzozowski;Math. Theory Automat. MRI Sympos. Ser.,1962
4. Theoretical study and implementation of the canonical automaton;Champarnaud;Fund. Inform.,2003
5. J.-M. Champarnaud, F. Coulon, T. Paranthoën, Compact and fast algorithms for safe regular expression search, Int. J. Comput. Math. 81 (2004) 383–401.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献