Author:
Björklund Henrik,Martens Wim
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference33 articles.
1. P. Abdulla, J. Deneux, L. Kaati, M. Nilsson, Minimization of non-deterministic automata with large alphabets, in: International Conference on Implementation and Application of Automata (CIAA), 2005, pp 31–42.
2. Hyper-minimizing minimized deterministic finite state automata;Badr;Inform. Théorique Appl.,2009
3. Continuant polynomials and worst-case behavior of hopcroftʼs minimization algorithm;Berstel;Theoret. Comput. Sci.,2009
4. J. Berstel, L. Boasson, O. Carton, I. Fagnot, Minimization of automata, Technical Report 1010.5318, CoRR abs, 2010.
5. G.J. Bex, W. Gelade, W. Martens, F. Neven, Simplifying XML Schema: Effortless handling of nondeterministic regular expressions, in: International Symposium on Management of Data (SIGMOD), 2009, pp. 731–744.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献