- Report on Generic Case Complexity Robert Gilman
- Contemporary Mathematics One Variable Equations in Free Groups
- 5. Automata and Grammars Finite automata accepting rational languages may be viewed as grammars and also
- WORD HYPERBOLIC SEMIGROUPS ANDREW DUNCAN AND ROBERT H. GILMAN
- A SHRINKING LEMMA FOR INDEXED LANGUAGES Robert H. Gilman
- 14. Counter Machines Counter languages are the family C = F(P, 1) where P is the free abelian group on
- 1. Definition of Rational Sets The rational subsets of a monoid M are the closure of its finite subsets under sum,
- ON BOUNDED LANGUAGES AND THE GEOMETRY OF NILPOTENT GROUPS
- 3. Rational Languages Subsets of finitely generated free monoids are called languages. Rational languages
- CONTEXTFREE LANGUAGES OF SUBEXPONENTIAL GROWTH
- Robert H. Gilman Curriculum Vitae
- THE GEOMETRY OF CYCLES IN THE CAYLEY DIAGRAM OF A GROUP
- THE GEOMETRY OF CYCLES IN THE CAYLEY DIAGRAM OF A GROUP
- Automatic Groups and String Rewriting Robert H. Gilman
- 4. Applications of Rational Languages Let G be a finitely generated group. A choice of generators for G is a surjective
- AUTOMATIC QUOTIENTS OF FREE GROUPS ROBERT H. GILMAN
- A GEOMETRIC ZERO-ONE LAW ROBERT H. GILMAN, YURI GUREVICH, AND ALEXEI MIASNIKOV
- SOLVING ONE-VARIABLE EQUATIONS IN FREE GROUPS DIMITRI BORMOTOV ROBERT GILMAN ALEXEI MYASNIKOV
- New Developments in Commutator Key Exchange Robert Gilman, Alex D. Miasnikov, Alexei G.
- ON GROUPS WHOSE WORD PROBLEM IS SOLVED BY A NESTED STACK AUTOMATON
- COMBING NILPOTENT AND POLYCYCLIC GROUPS ROBERT H. GILMAN, DEREK F. HOLT, AND SARAH REES
- FORMAL LANGUAGES AND INFINITE GROUPS ROBERT H. GILMAN
- FORMAL LANGUAGE THEORY AND THE GEOMETRY OF 3-MANIFOLDS
- Automatic Groups and String Rewriting Robert H. Gilman
- A REMARK ABOUT COMBINGS OF GROUPS Martin R. Bridson and Robert H. Gilman
- 2. Automata The rational subsets of a monoid M are precisely the subsets accepted by finite
- 6. Contextfree Languages G be a choice of generators for the group G. W = -1
- 7. ContextFree Presentations Recall that rational subsets of groups generate finitely generated subgroups. There
- 11. Rational Relations A relation : S T is a subset of S T. We define (s) = {t | (s, t) }; and
- 12. Automatic Groups Suppose
- 13. Families of Languages Finite automata over free monoids accept rational languages. Automata over other
- COMBING NILPOTENT AND POLYCYCLIC GROUPS ROBERT H. GILMAN, DEREK F. HOLT, AND SARAH REES
- FORMAL LANGUAGE THEORY AND THE GEOMETRY OF 3-MANIFOLDS
- CONTEXT-FREE LANGUAGES OF SUB-EXPONENTIAL GROWTH
- A SHRINKING LEMMA FOR INDEXED LANGUAGES Robert H. Gilman
- 10. Complexity There are many types of languages we have not discussed so far. Languages defined
- A CHARACTERISATION OF VIRTUALLY FREE GROUPS ROBERT H. GILMAN, SUSAN HERMILLER, DEREK F. HOLT, AND SARAH REES
- 8. Groups with contextfree word problem Suppose G has contextfree word problem. Fix a set of generators
- 9. Groups with contextfree multiplication table G be a choice of generators affording a rational language R
- ON GROUPS WHOSE WORD PROBLEM IS SOLVED BY A NESTED STACK AUTOMATON
- ON BOUNDED LANGUAGES AND THE GEOMETRY OF NILPOTENT GROUPS
- A REMARK ABOUT COMBINGS OF GROUPS Martin R. Bridson and Robert H. Gilman
- AUTOMATIC QUOTIENTS OF FREE GROUPS ROBERT H. GILMAN
- FORMAL LANGUAGES AND INFINITE GROUPS ROBERT H. GILMAN
