Karel Culik II & Hermann A. Maurer (1977):
Tree controlled grammars.
Computing 19(2),
pp. 129–139,
doi:10.1007/BF02252350.
Jürgen Dassow & Bianca Truthe (2008):
Subregularly Tree Controlled Grammars and Languages.
In: Erzsébet Csuhaj-Varjú & Zoltán Ésik: Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings,
pp. 158–169.
Viliam Geffert (1991):
Normal forms for phrase-structure grammars.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 25(5),
pp. 473–496,
doi:10.1051/ita/1991250504731.
John E. Hopcroft, Rajeev Motwani & Jeffrey D. Ullman (2007):
Introduction to Automata Theory, Languages, and Computation,
3rd edition.
Pearson.
Zbyněk Křivka & Alexander Meduna (2021):
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete.
Fundamenta Informaticae 179(4),
pp. 361–384,
doi:10.3233/FI-2021-2028.
Alexander Meduna (2000):
Automata and Languages: Theory and Applications.
Springer,
London,
doi:10.1007/978-1-4471-0501-5.
Sherzod Tuarev, Jürgen Dassow & Mohd H. Selamat (2011):
Nonterminal complexity of tree controlled grammars.
Theoretical Computer Science 412,
pp. 5789–5795,
doi:10.1016/j.tcs.2011.06.033.
Sherzod Turaev, Jürgen Dassow, Florin Manea & Mohd H. Selamat (2012):
Language classes generated by tree controlled grammars with bounded nonterminal complexity.
Theoretical Computer Science 449,
pp. 134–144,
doi:10.1016/j.tcs.2012.04.013.
eptcs@eptcs.org