A finitely generated group is synchronously combable if it admits a combing of a group with the synchronous fellow-traveller property. Without a regular-language assumption, this is more general than an automatic group. A bounded-rung strip argument gives a finite group presentation, and finite-state row shortening gives a recursive exponential filling bound and a soluble word problem for a group.
New to topics? Read the docs here!