| Copyright | (c) Andrew Lelechenko, 2015 |
|---|---|
| License | GPL-3 |
| Maintainer | andrew.lelechenko@gmail.com |
| Stability | experimental |
| Portability | POSIX |
| Safe Haskell | None |
| Language | Haskell2010 |
Math.ExpPairs.PrettyProcess
Description
Transforms sequences of Process into most compact (by the means of typesetting) representation using brackets and powers.
E. g., AAAABABABA -> A^4(BA)^3.
This module uses memoization extensively.
- prettify :: [Process] -> PrettyProcess
- uglify :: PrettyProcess -> [Process]
- data PrettyProcess
Documentation
prettify :: [Process] -> PrettyProcess Source #
Find the most compact representation of the sequence of processes.
uglify :: PrettyProcess -> [Process] Source #
Unfold back PrettyProcess into the sequence of Process.