Commit b78e032b authored by Thorsten Wißmann's avatar Thorsten Wißmann 🐧

Update README.md

parent 7cbe4dbc
......@@ -9,11 +9,11 @@ The genericity of copar covers the minimization of
- and *combinations* thereof (under derived bismilarity notions, e.g. backwards bisimilarity for weighted tree automata).
The algorithm runs in *O(m log n)* on a system with *n* states and *m*
transitions and has been developed in a series of publications, see the [Literature](doc/literature.md) file.
For installation, see the [Install](INSTALL.md) file.
transitions and has been developed in a series of publications, see the [literature file](doc/literature.md).
## Usage
Installation instructions can be found in the [install file](INSTALL.md).
The core partition-refinement algorithm can be called by
./copar refine FILENAME
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment