On a subclass of context-free groups
RAIRO-Theor. Inf. Appl., 25 3 (1991) 255-272
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):
Free products of semigroups and monoids with a deterministic context-free word problem
Peter KostolányiInformation Processing Letters 188 106541 (2025)
https://doi.org/10.1016/j.ipl.2024.106541
Effective Equation Solving, Constraints, and Growth in Virtually Abelian Groups
Laura Ciobanu, Alex Evetts and Alex LevineSIAM Journal on Applied Algebra and Geometry 9 (1) 235 (2025)
https://doi.org/10.1137/23M1604679
COMPUTING CENTRALISERS IN [FINITELY GENERATED FREE]-BY-CYCLIC GROUPS
ANDRÉ CARVALHOBulletin of the Australian Mathematical Society 1 (2024)
https://doi.org/10.1017/S0004972724000443
Generalizations of the Muller–Schupp theorem and tree‐like inverse graphs
Emanuele RodaroJournal of the London Mathematical Society 109 (5) (2024)
https://doi.org/10.1112/jlms.12903
Subsets of groups in public-key cryptography
André Carvalho and António MalheiroAdvances in Mathematics of Communications (2024)
https://doi.org/10.3934/amc.2024036
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices
Volker Diekert, Igor Potapov and Pavel SemukhinSIAM Journal on Computing 53 (6) 1663 (2024)
https://doi.org/10.1137/22M1512612
On the word problem for free products of semigroups and monoids
Carl-Fredrik Nyberg-BroddaJournal of Algebra 622 721 (2023)
https://doi.org/10.1016/j.jalgebra.2023.02.007
Algebraic and context-free subsets of subgroups
André CarvalhoTheoretical Computer Science 980 114229 (2023)
https://doi.org/10.1016/j.tcs.2023.114229
On generalized conjugacy and some related problems
André CarvalhoCommunications in Algebra 51 (8) 3528 (2023)
https://doi.org/10.1080/00927872.2023.2186132
New results on the prefix membership problem for one-relator groups
Igor Dolinka and Robert GrayTransactions of the American Mathematical Society 374 (6) 4309 (2021)
https://doi.org/10.1090/tran/8338
Word problems of groups: Formal languages, characterizations and decidability
Sam A.M. Jones and Richard M. ThomasTheoretical Computer Science 750 2 (2018)
https://doi.org/10.1016/j.tcs.2018.05.007
Reachability Problems
Sam A. M. Jones and Richard M. ThomasLecture Notes in Computer Science, Reachability Problems 9899 104 (2016)
https://doi.org/10.1007/978-3-319-45994-3_8
The (nested) word problem
Christopher S. HenryInformation Processing Letters 116 (11) 729 (2016)
https://doi.org/10.1016/j.ipl.2016.06.013
Descriptional Complexity of Formal Systems
Gabriela Aslı Rino Nesin and Richard M. ThomasLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 9118 243 (2015)
https://doi.org/10.1007/978-3-319-19225-3_21
Reachability Problems
Sam A. M. Jones and Richard M. ThomasLecture Notes in Computer Science, Reachability Problems 8169 146 (2013)
https://doi.org/10.1007/978-3-642-41036-9_14
Developments in Language Theory
Michael Hoffmann, Derek F. Holt, Matthew D. Owens and Richard M. ThomasLecture Notes in Computer Science, Developments in Language Theory 7410 97 (2012)
https://doi.org/10.1007/978-3-642-31653-1_10
Space Complexity and Word Problems of Groups
Stephen R. Lakin and Richard M. ThomasGroups – Complexity – Cryptology 1 (2) (2009)
https://doi.org/10.1515/GCC.2009.261
Automatic presentations for semigroups
Alan J. Cain, Graham Oliver, Nik Ruškuc and Richard M. ThomasInformation and Computation 207 (11) 1156 (2009)
https://doi.org/10.1016/j.ic.2009.02.005
The loop problem for Rees matrix semigroups
Mark KambitesSemigroup Forum 76 (2) 204 (2008)
https://doi.org/10.1007/s00233-007-9016-6
GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
DEREK F. HOLT, MATTHEW D. OWENS and RICHARD M. THOMASJournal of the Australian Mathematical Society 85 (2) 197 (2008)
https://doi.org/10.1017/S1446788708000864
ON GROUPS AND COUNTER AUTOMATA
MURRAY ELDER, MARK KAMBITES and GRETCHEN OSTHEIMERInternational Journal of Algebra and Computation 18 (08) 1345 (2008)
https://doi.org/10.1142/S0218196708004901
ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES
CLAAS E. RÖVERInternational Journal of Algebra and Computation 14 (04) 499 (2004)
https://doi.org/10.1142/S0218196704001876
On groups whose word problem is solved by a~counter automaton
Gillian Z. Elston and Gretchen OstheimerTheoretical Computer Science 320 (2-3) 175 (2004)
https://doi.org/10.1016/j.tcs.2003.09.007
GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
Duncan W. Parkes and Richard M. ThomasCommunications in Algebra 30 (7) 3143 (2002)
https://doi.org/10.1081/AGB-120004481
Group presentations, formal languages and characterizations of one-counter groups
Thomas Herbst and Richard M. ThomasTheoretical Computer Science 112 (2) 187 (1993)
https://doi.org/10.1016/0304-3975(93)90018-O
On a kind of Fatou property of context-free groups
Thomas HerbstTheoretical Computer Science 93 (2) 327 (1992)
https://doi.org/10.1016/0304-3975(92)90337-F