Proceedings of the American Mathematical Society · 1996 · 10 citations · 2 references
Natural SciencesMathematicsCombinatoricsGeometryTopologyAutomata TheoryFinite AutomataFixed PointsGroup TheoryHyperbolic GeometryRegular LanguagesFinite Automata TheoryGeodesic StructureGeodesics In Hyperbolic SpaceHyperbolic Fixed PointsPumpingPumping Lemma
e enhancement of the Pumping Lemma. fixpoint.tex 1 05/03/94 Ultra-Pumping Lemma. Let fa i g be an L-ray where L is a regular language over the finite alphabet A. There exists an integer M 0 such that, for each integer n ? 0, there exists an integer N n such that (a 1 \\Delta \\Delta \\Delta aM )(a M+1 \\Delta \\Delta \\Delta aM+N ) r 2 L for every integer r 0. Proof. Let W be a finite state automaton accepting L. The L-ray fa i g describes an infinite path in W and, as there are only finitely many (accept)
2
Notes on word hyperbolic groups
J.M Alonso, Thomas J. Brady, D. Cooper et al. · Optics Letters · 1991 · 182 citations
Daniel E. Cohen · Bulletin of the London Mathematical Society · 1993 · 155 citations