Compressed Membership in Automata with Compressed Labels

@inproceedings{Lohrey2011CompressedMI,
title={Compressed Membership in Automata with Compressed Labels},
author={Markus Lohrey and Christian Mathissen},
booktitle={CSR},
year={2011}
}

The algorithmic problem of whether a compressed string is ac cepted by a (nondeterministic) finite state automaton with compres sed transition labels is investigated. For string compression, straight-line prog rams (SLPs), i.e., contextfree grammars that generate exactly one string, are used. Tw o algorithms for this problem are presented. The first one works in polynomial time, if all transition labels are nonperiodic strings (or more generally, t he word length divided by the period is… CONTINUE READING