1. Determinization of finite automata accepting subregular languages;Bordihn;Theoretical Computer Science,2009
2. Quotient complexity of ideal languages;Brzozowski,2010
3. Subregularly controlled derivations: the context-free case;Dassow;Rostocker Mathematisches Kolloquium,1988
4. Contextual grammars with subregular choice;Dassow;Fundamenta Informaticae,2005
5. Grammars with commutative, circular, and locally testable conditions;Dassow,2009