On groups which are syntactic monoids of
deterministic context-free languages
by Claas Röver
Keywords
syntactic monoids, context-free languages, wreath products
Abstract
In this note I show 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 answers to a question of T. Herbst.
This is published in Internat. J. Algebra Comput. 14 (2004), no. 4, 499-504.
Of course you can also ask me for a hard copy.