1. The ordinal generated by an ordinal grammar is computable;Theoretical Computer Science;2019-11
2. MSO-definable Properties of Muller Context-Free Languages Are Decidable;Descriptional Complexity of Formal Systems;2016
3. On Müller context-free grammars;Theoretical Computer Science;2012-01
4. ORDINAL AUTOMATA AND CANTOR NORMAL FORM;International Journal of Foundations of Computer Science;2012-01
5. Büchi context-free languages;Theoretical Computer Science;2011-03