exp-pairs-0.2.0.0: Linear programming over exponent pairs

Copyright(c) Andrew Lelechenko 2015
LicenseGPL-3
Maintainerandrew.lelechenko@gmail.com
Stabilityexperimental
PortabilityPOSIX
Safe HaskellNone
LanguageHaskell2010

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.

Synopsis

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.

data PrettyProcess Source #

Compact representation of the sequence of Process.