1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of ACM Symposium on Theory of Computing, pp. 202–211 (2004)
2. Champarnaud, J.-M., Coulon, F.: Büchi automata reduction by means of left and right trace inclusion preorder. Manuscript (2004)
3. Dassow, J.: On the number of accepting states of finite automata. J. Automata Lang. Comb. 21, 55–67 (2016)
4. Dassow, J., Stiebe, R.: Nonterminal complexity of some operations on context-free languages. Fundam. Inform. 83, 35–49 (2008)
5. Dassow, J., Harbich, R.: Descriptional complexity of union and star on context-free languages. J. Automata Lang. Comb. 17, 123–143 (2012)