Finiteness Conditions on Subgroups and Formal Language Theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1259068
- On finiteness of verbal subgroups
- scientific article; zbMATH DE number 848082
- A finiteness condition for verbal subgroups
- Publication:4867142
- On the definability of verbal subgroups
- Formal languages, word problems of groups and decidability
- scientific article; zbMATH DE number 1283959
- scientific article; zbMATH DE number 3854452
- scientific article; zbMATH DE number 3193769
Cited in
(13)- Group presentations, formal languages and characterizations of one- counter groups
- Cancellation in context-free languages: enrichment by reduction
- Green index in semigroups: generators, presentations, and automatic structures.
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
- \(\mathcal{L}\)-reduction computation revisited
- The generalized conjugacy problem for virtually free groups.
- On a subclass of context-free groups
- Groups, graphs, languages, automata, games and second-order monadic logic
- Context-free pairs of groups. I: Context-free pairs and graphs
- Finitely generated subgroups of free groups as formal languages and their cogrowth
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- Inverse subsemigroups of finite index in finitely generated inverse semigroups
- On the rational subset problem for groups.
This page was built for publication: Finiteness Conditions on Subgroups and Formal Language Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3828188)
