Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs.

Marius Bozga, Radu Iosif, Florian Zuleger

Browse the full MFCS paper archive.