On a subclass of context-free groups
From MaRDI portal
Recommendations
Cites work
- A Note on Free Groups
- A regularity test for pushdown machines
- Finiteness Conditions on Subgroups and Formal Language Theory
- Groups and NTS languages
- Groups and Simple Languages
- Groups, the theory of ends, and context-free languages
- scientific article; zbMATH DE number 3642711 (Why is no real title available?)
- scientific article; zbMATH DE number 4047162 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3504469 (Why is no real title available?)
- scientific article; zbMATH DE number 3608314 (Why is no real title available?)
- scientific article; zbMATH DE number 4003555 (Why is no real title available?)
- scientific article; zbMATH DE number 3224578 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3339488 (Why is no real title available?)
- scientific article; zbMATH DE number 3381862 (Why is no real title available?)
- Monadic Thue systems
- Regularity and Related Problems for Deterministic Pushdown Automata
- Sur une propriété d'itération des langages algébriques déterministes
- The accessibility of finitely presented groups
- Theory of traces
Cited in
(32)- Automatic presentations for semigroups.
- On a kind of Fatou property of context-free groups
- Group presentations, formal languages and characterizations of one- counter groups
- Word problems of groups: formal languages, characterizations and decidability
- Non-finitely generated maximal subgroups of context-free monoids
- The loop problem for Rees matrix semigroups.
- The (nested) word problem
- On the word problem for free products of semigroups and monoids
- Groups with context-free conjugacy problems.
- Context-Free Groups and Bass–Serre Theory
- New results on the prefix membership problem for one-relator groups
- Context-free irreducible word problems in groups.
- Context-free pairs of groups. I: Context-free pairs and graphs
- ON SUBCLASSES OF GROUPS WITHOUT FREE SUBSEMIGROUPS
- ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- Groups whose word problem is a Petri net language
- Groups and NTS languages
- On groups whose word problem is solved by a counter automaton.
- Algebraic and context-free subsets of subgroups
- On generalized conjugacy and some related problems
- Groups with context-free Diophantine problem
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- Free products of semigroups and monoids with a deterministic context-free word problem
- The power of a single qubit: two-way quantum finite automata and the word problem
- Geodesic languages for rational subsets and conjugates in virtually free groups
- Computing centralisers in [finitely generated free]-by-cyclic groups
- Commutative semigroups with a context-free word problem
- Effective equation solving, constraints, and growth in virtually abelian groups
- Subsets of groups in public-key cryptography
- Lower bounds on the running time of two-way quantum finite automata and sublogarithmic-space quantum Turing machines
- On groups with EDT0L word problem
This page was built for publication: On a subclass of context-free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978768)
