pdfformat: 

@InProceedings{valmari_et_al:LIPIcs:2008:1328, author = {Antti Valmari and Petri Lehtinen}, title = {{Efficient Minimization of DFAs with Partial Transition}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {645656}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897064}, ISSN = {18688969}, year = {2008}, volume = {1}, editor = {Susanne Albers and Pascal Weil}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1328}, URN = {urn:nbn:de:0030drops13286}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2008.1328}, annote = {Keywords: Deterministic finite automaton, sparse adjacency matrix, partition refinement} }
Keywords:  Deterministic finite automaton, sparse adjacency matrix, partition refinement  
Seminar:  25th International Symposium on Theoretical Aspects of Computer Science  
Issue date:  2008  
Date of publication:  06.02.2008 