I was studying Unger's Parsers and was in need of a way to generate the k-partitions of the input string.
I wasn't able to find it neither in math.combinatorics,splitting, grouping or by a general search. I'm currently working on implementing one myself from the integer partitioning in this paper ( http://www.nakano-lab.cs.gunma-u.ac.jp/Papers/e90-a_5_888.pdf ) but would gladly use something that is already present in factor. So, is there any word ( or simple combination of words ) that I'm somehow missing that will let me build the k-partitions of a sequence/string?
_______________________________________________ Factor-talk mailing list Factor-talk@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/factor-talk
