Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix.

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek

Browse the full CONCUR paper archive.