H. Bordihn and H. Fernau, Accepting grammars with regulation, International Journal of Computer Mathematics, vol.53, pp.1-18, 1994.

H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez et al., Tree Automata, Techniques and Applications, 2007.

E. Csuhaj-varjú, J. Dassow, J. Kelemen, and G. P?un, Grammar Systems: A Grammatical Approach to Distribution and Cooperation, 1994.

J. Dassow and G. P?un, Regulated Rewriting in Formal Language Theory, EATCS Monographs in Theoretical Computer Science, vol.18, 1989.

J. Doner, Tree acceptors and some of their applications, Journal of Computer and System Sciences, vol.4, issue.5, pp.406-451, 1970.

H. Fernau, Graph-controlled grammars as language acceptors, Languages and Combinatorics, vol.2, issue.2, pp.79-91, 1997.

H. Fernau, Parallel grammars: A phenomenology, GRAMMARS, vol.6, pp.25-87, 2003.

H. Fernau, Cooperating distributed tree automata, Languages Alive

, Dassow Festschrift, vol.7300, pp.75-85, 2012.

H. Fernau and H. Bordihn, Remarks on accepting parallel systems, International Journal of Computer Mathematics, vol.56, pp.51-67, 1995.

H. Fernau, M. Holzer, and H. Bordihn, Accepting multi-agent systems: the case of cooperating distributed grammar systems, Computers and Artificial Intelligence, vol.15, issue.2-3, pp.123-139, 1996.

R. Freund, M. Kogler, and M. Oswald, A general framework for regulated rewriting based on the applicability of rules, Computation, Cooperation, and Life, vol.6610, pp.35-53, 2011.

F. Gécseg and M. Steinby, , 1984.

L. Kallmeyer, Parsing Beyond Context-Free Grammars, 2010.

A. Meduna and D. Kolar, Regulated pushdown automata, Acta Cybernetica, vol.14, pp.653-664, 2000.

A. Meduna and P. Zemek, Regulated Grammars and Automata, 2014.

J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, Journal of Computer and System Sciences, vol.1, pp.317-322, 1967.

M. Vu, , 2016.

D. Wood, Bicolored digraph grammar systems, RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications, vol.1, pp.45-50, 1973.

G. Zetzsche, S. Abramsky, C. Gavoille, C. Kirchner, and F. M. Auf-der-heide, On erasing productions in random context grammars, Automata, Languages and Programming, ICALP 2010, Part II, vol.6199, pp.175-186, 2010.