We call these systems divisible transition systems and prove a number of theoretical results about their expressivity and complexity.
we characterize an important subclass called efficient divisible transition systems that parse planar dependency graphs in linear time.