Location of Repository

The class of co-context-free groups is studied. A co-context-free group is defined as one whose coword\ud problem (the complement of its word problem) is context-free. This class is larger than the\ud subclass of context-free groups, being closed under the taking of finite direct products, restricted\ud standard wreath products with context-free top groups, and passing to finitely generated subgroups\ud and finite index overgroups. No other examples of co-context-free groups are known. It is proved\ud that the only examples amongst polycyclic groups or the Baumslag–Solitar groups are virtually\ud abelian. This is done by proving that languages with certain purely arithmetical properties cannot\ud be context-free; this result may be of independent interest

Topics:
QA

Publisher: Cambridge University Press

Year: 2005

OAI identifier:
oai:wrap.warwick.ac.uk:746

Provided by:
Warwick Research Archives Portal Repository

- (1993). A course in the theory of groups (Springer,
- (1987). Algebraic number theory, 2nd edn (Chapman &
- (1976). Combinatorial group theory
- (1992). Decision problems for groups – survey and reﬂection’, Algorithms and classiﬁcation in combinatorial group theory
- (2004). Groups with indexed co-word problem’,
- (1983). Groups, the theory of ends, and context-free languages’,
- (1979). Introduction to automata theory, languages, and computation (Addison–Wesley,
- (1961). Language generating devices’,
- (1991). On a subclass of context-free groups’,
- (1971). On group-theoretic decision problems and their classiﬁcation’,
- (2000). Syntactic monoids and word problems’,
- (1985). The accessibility of ﬁnitely presented groups’,
- (1971). The group languages’,
- (1994). The language of machines: an introduction to computability and formal languages
- (1966). The mathematical theory of context-free languages (McGraw–Hill,
- (1985). The theory of ends, pushdown automata, and second-order logic’,