Regular Grammars for Sets of Graphs of Tree-Width 2

Marius Bozga, Radu Iosif, Florian Zuleger

Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classe…