A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata

@inproceedings{citeulike:2137852, address = {London, UK}, author = {Habib, Michel and Paul, Christophe and Vienot, Laurent }, booktitle = {STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science}, citeulike-article-id = {2137852}, isbn = {3540642307}, keywords = {algorithms, automata, graph, math}, pages = {25--38}, posted-at = {2007-12-17 18:46:57}, priority = {2}, publisher = {Springer-Verlag}, title = {A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata}, url = {http://portal.acm.org/citation.cfm?id=646513.695647}, year = {1998} }

TY - CONF ID - citeulike:2137852 L3 - citeulike-article-id:2137852 TI - A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata T2 - STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science SP - 25 EP - 38 AD - London, UK PB - Springer-Verlag SN - 3540642307 KW - algorithms KW - automata KW - graph KW - math AU - Habib, Michel AU - Paul, Christophe AU - Vienot, Laurent PY - 1998/// UR - http://portal.acm.org/citation.cfm?id=646513.695647 ER -