-graph automatic groups
- 1 September 2014
- journal article
- Published by Elsevier in Journal of Algebra
- Vol. 413, 289-319
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council (FT110100178, DMS-1105407)
- National Science Foundation (FT110100178, DMS-1105407)
This publication has 24 references indexed in Scilit:
- Tree-based language complexity of Thompson's group FGroups - Complexity - Cryptology, 2015
- A linear-time algorithm to compute geodesics in solvable Baumslag–Solitar groupsIllinois Journal of Mathematics, 2010
- ON GROUPS AND COUNTER AUTOMATAInternational Journal of Algebra and Computation, 2008
- Word problems recognisable by deterministic blind monoid automataTheoretical Computer Science, 2006
- Parallel poly-pushdown groupsJournal of Pure and Applied Algebra, 1999
- Formal language theory and the geometry of 3-manifoldsCommentarii Mathematici Helvetici, 1996
- Remarks on blind and partially blind one-way multicounter machinesTheoretical Computer Science, 1978
- Remarks on the complexity of nondeterministic counter languagesTheoretical Computer Science, 1976
- Multi-stack-counter languagesTheory of Computing Systems, 1972
- Counter machines and counter languagesTheory of Computing Systems, 1968