A python tool for solving reachability/safety, parity, weak parity and generalized parity games
-
Updated
Aug 16, 2018 - Python
A python tool for solving reachability/safety, parity, weak parity and generalized parity games
Efficient C++ implementations of different fast algorithms for Minimum Path Cover
Counting (maximal) antichains of non-crossing partitions
Counting (maximal) antichains in the lattice of set partitions
Contains the codes and formal context files for (maximal) antichains of Tamari lattices
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
Add a description, image, and links to the antichains topic page so that developers can more easily learn about it.
To associate your repository with the antichains topic, visit your repo's landing page and select "manage topics."