Alfred Aho (1968):
Indexed Grammars – An Extension of Context-Free Grammars.
Journal of the ACM 15(4),
pp. 647–671,
doi:10.1145/321479.321488.
Alfred Aho & Jeffrey Ullman (1972):
Translations on a Context Free Grammar.
Information and Control 19(5),
pp. 439–475,
doi:10.1016/S0019-9958(71)90706-6.
Anatoly Anisimov (1971):
Group languages.
Cybernetics 7,
pp. 594–601,
doi:10.1007/BF01071030.
Peter Asveld (1977):
Controlled iteration grammars and full hyper-AFL's.
Information and Control 34(3),
pp. 248–269,
doi:10.1016/S0019-9958(77)90308-4.
Laura Ciobanu & Murray Elder (2019):
Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE.
In: Proc. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019),
Leibniz International Proceedings in Informatics (LIPIcs) 132.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
pp. 110:1–110:15,
doi:10.4230/LIPIcs.ICALP.2019.110.
Laura Ciobanu, Murray Elder & Michal Ferov (2018):
Applications of L systems to group theory.
International Journal of Algebra and Computation 28(2),
pp. 309–329,
doi:10.1142/S0218196718500145.
Tobias Denkinger (2016):
An Automata Characterisation for Multiple Context-Free Languages.
In: Proc. International Conference on Developments in Language Theory (DLT 2016),
Lecture Notes in Computer Science 9840.
Springer,
pp. 138–150,
doi:10.1007/978-3-662-53132-7_12.
Frank Drewes, Hans-Jörg Kreowski & Annegret Habel (1997):
Hyperedge Replacement Graph Grammars,
pp. 95–162.
World Scientific,
doi:10.1142/9789812384720_0002.
Andrzej Ehrenfeucht & Grzegorz Rozenberg (1977):
On some context-free languages that are not deterministic ET0L languages.
R.A.I.R.O. Informatique théorique 11(4),
pp. 273–291,
doi:10.1051/ita/1977110402731.
Joost Engelfriet & Linda Heyker (1991):
The string generating power of context-free hypergraph grammars.
Journal of Computer and System Sciences 43(2),
pp. 328–360,
doi:10.1016/0022-0000(91)90018-Z.
Robert Gilman, Robert Kropholler & Saul Schleimer (2018):
Groups whose word problems are not semilinear.
Groups Complexity Cryptology 10(2),
pp. 53–62,
doi:10.1515/gcc-2018-0010.
Robert Gilman & Michael Shapiro (1998):
On groups whose word problem is solved by a nested stack automaton.
Available at https://arxiv.org/abs/math/9812028.
Annegret Habel (1992):
Hyperedge Replacement: Grammars and Languages.
Lecture Notes in Computer Science 643.
Springer,
doi:10.1007/BFb0013875.
Allen Hatcher (2002):
Algebraic Topology.
Cambridge University Press.
Thomas Herbst & Richard Thomas (1993):
Group presentations, formal languages and characterizations of one-counter groups.
Theoretical Computer Science 112(2),
pp. 187–213,
doi:10.1016/0304-3975(93)90018-O.
Meng-Che Ho (2018):
The word problem of Z^n is a multiple context-free language.
Groups Complexity Cryptology 10(1),
pp. 9–15,
doi:10.1515/gcc-2018-0003.
John Hopcroft, Rajeev Motwani & Jeffrey Ullman (2006):
Introduction to Automata Theory, Languages, and Computation,
3rd ed. edition.
Addison-Wesley.
Hans-Jörg Kreowski (1992):
Parallel Hyperedge Replacement,
pp. 271–282.
Springer,
doi:10.1007/978-3-642-58117-5_17.
Hans-Jörg Kreowski (1993):
Five facets of hyperedge replacement beyond context-freeness.
In: Proc. 9th International Conference on Fundamentals of Computation Theory (FCT 1993),
Lecture Notes in Computer Science 710.
Springer,
pp. 69–86,
doi:10.1007/3-540-57163-9_5.
Robert Kropholler & Davide Spriano (2019):
Closure properties in the class of multiple context-free groups.
Groups Complexity Cryptology 11(1),
pp. 1–15,
doi:10.1515/gcc-2019-2004.
William Massey (1977):
Algebraic Topology: An Introduction.
Graduate Texts in Mathematics 56.
Springer.
David Muller & Paul Schupp (1983):
Groups, the Theory of Ends, and Context-Free Languages.
Journal of Computer and System Sciences 26(3),
pp. 295–310,
doi:10.1016/0022-0000(83)90003-X.
Mogens Nielsen (1975):
EOL systems with control devices.
Acta Informatica 4,
pp. 373–386,
doi:10.1007/BF00289618.
Taishin Nishida & Shigeko Seki (2000):
Grouped partial ET0L systems and parallel multiple context-free grammars.
Theoretical Computer Science 246(1–2),
pp. 131–150,
doi:10.1016/S0304-3975(99)00076-6.
Pyotr Novikov (1955):
Über die algorithmische Unentscheidbarkeit des Wortproblems in der Gruppentheorie.
Trudy Matematicheskogo Instituta imeni V.A. Steklova 44,
pp. 1–143.
Rohit Parikh (1966):
On Context-Free Languages.
Journal of the ACM 13(4),
pp. 570–581,
doi:10.1145/321356.321364.
Grzegorz Rozenberg & Arto Salomaa (1980):
The Mathematical Theory of L Systems.
Pure and Applied Mathematics 90.
Academic Press.
Sylvain Salvati (2015):
MIX is a 2-MCFL and the word problem in Z^2 is captured by the IO and the OI hierarchies.
Journal of Computer and System Sciences 81(7),
pp. 1252–1277,
doi:10.1016/j.jcss.2015.03.004.
Vijay Shanker, David Weir & Aravind Joshi (1987):
Characterizing structural descriptions produced by various grammatical formalisms.
In: Proc. 25th Annual Meeting on Association for Computational Linguistics (ACL '87).
Association for Computational Linguistics,
pp. 104–111,
doi:10.3115/981175.981190.
David Weir (1992):
Linear context-free rewriting systems and deterministic tree-walking transducers.
In: Proc. 30th Annual Meeting of the Association for Computational Linguistics.
Association for Computational Linguistics,
pp. 136–143,
doi:10.3115/981967.981985.
eptcs@eptcs.org