
The author shows that the class of groups which are syntactic monoids of deterministic context-free languages is closed under restricted standard wreath products with virtually free top groups. This provides an answer to a question of T. Herbst.
Extensions, wreath products, and other compositions of groups, context-free languages, syntactic monoids, Semigroups in automata theory, linguistics, etc., wreath products, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, Word problems, etc. in computability and recursion theory
Extensions, wreath products, and other compositions of groups, context-free languages, syntactic monoids, Semigroups in automata theory, linguistics, etc., wreath products, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, Word problems, etc. in computability and recursion theory
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
