1. Indexed grammars—an extension of context-free grammars;Aho;J. ACM,1968
2. On the computational complexity of synchronized context-free languages;Bordihn;J. Universal Comput. Sci.,2002
3. M. Daley, O. Ibarra, L. Kari, I. McQuillan, K. Nakano, Closure and decision properties of some language classes under ld and dlad bio-operations, J. Autom., Lang. and Combin. 8 (2003) 477–498.
4. Regulated Rewriting in Formal Language Theory;Dassow,1989
5. Stack machines and classes of nonnested macro languages;Engelfriet;J. ACM,1980