A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata.
Michel HabibChristophe PaulLaurent ViennotPublished in: STACS (1998)
Keyphrases
- finite automata
- cellular automata
- graph matching
- program synthesis
- finite state automata
- regular languages
- edit distance
- texture synthesis
- graph representation
- graph databases
- regular expressions
- graph structure
- graph mining
- boolean functions
- real valued
- kronecker product
- adjacency graph
- graph partitioning
- string matching
- refinement process
- directed graph
- grammatical inference
- singular value decomposition
- tree automata
- graph theoretic
- pattern matching
- graph model