On some context free languages that are not deterministic ETOL languages
RAIRO. Inform. théor., 11 4 (1977) 273-291
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
EDT0L solutions to equations in group extensions
Alex LevineJournal of Algebra 619 860 (2023)
https://doi.org/10.1016/j.jalgebra.2022.11.031
Using edt0l systems to solve some equations in the solvable Baumslag-Solitar groups
Andrew Duncan, Alex Evetts, Derek F. Holt and Sarah ReesJournal of Algebra 630 434 (2023)
https://doi.org/10.1016/j.jalgebra.2023.04.020
Parallel Hyperedge Replacement String Languages
Graham CampbellElectronic Proceedings in Theoretical Computer Science 334 46 (2021)
https://doi.org/10.4204/EPTCS.334.4
A language hierarchy of binary relations
Tara Brough and Alan J. CainInformation and Computation 275 104607 (2020)
https://doi.org/10.1016/j.ic.2020.104607
Solutions to twisted word equations and equations in virtually free groups
Volker Diekert and Murray ElderInternational Journal of Algebra and Computation 30 (04) 731 (2020)
https://doi.org/10.1142/S0218196720500198
Two applications of monoid actions to cross-sections
Tara Brough, Alan J. Cain and Victor MaltcevCommunications in Algebra 48 (5) 1894 (2020)
https://doi.org/10.1080/00927872.2019.1710160
The complexity of verbal languages over groups
Sanjay Jain, Alexei Miasnikov and Frank StephanJournal of Computer and System Sciences 101 68 (2019)
https://doi.org/10.1016/j.jcss.2018.10.005
Solution sets for equations over free groups are EDT0L languages
Laura Ciobanu, Volker Diekert and Murray ElderInternational Journal of Algebra and Computation 26 (05) 843 (2016)
https://doi.org/10.1142/S0218196716500363
Automata, Languages, and Programming
Laura Ciobanu, Volker Diekert and Murray ElderLecture Notes in Computer Science, Automata, Languages, and Programming 9135 134 (2015)
https://doi.org/10.1007/978-3-662-47666-6_11
Grouped partial ET0L systems and parallel multiple context-free grammars
T.Y. Nishida and S. SekiTheoretical Computer Science 246 (1-2) 131 (2000)
https://doi.org/10.1016/S0304-3975(99)00076-6
The Dyck language D'1∗ is not generated by any matrix grammar of finite index
Brigitte RozoyInformation and Computation 74 (1) 64 (1987)
https://doi.org/10.1016/0890-5401(87)90012-5
Outils et résultats pour les transducteurs boustrophédons
Brigitte RozoyRAIRO - Theoretical Informatics and Applications 20 (3) 221 (1986)
https://doi.org/10.1051/ita/1986200302211
Fundamentals of Computation Theory
B. RozoyLecture Notes in Computer Science, Fundamentals of Computation Theory 199 371 (1985)
https://doi.org/10.1007/BFb0028821
Sur les g�n�rateurs alg�briques et lin�aires
Michel LatteuxActa Informatica 13 (4) 347 (1980)
https://doi.org/10.1007/BF00288769
Tree transducers, L systems, and two-way machines
Joost Engelfriet, Grzegorz Rozenberg and Giora SlutzkiJournal of Computer and System Sciences 20 (2) 150 (1980)
https://doi.org/10.1016/0022-0000(80)90058-6
Some consequences of a result of Ehrenfeucht and Rozenberg
Gheorghe PăUNRAIRO. Informatique théorique 14 (1) 119 (1980)
https://doi.org/10.1051/ita/1980140101191