  Which amount of parallel resources is needed for updating a query result
after changing an input? In this work we study the amount of work required for
dynamically answering membership and range queries for formal languages in
parallel constant time with polynomially many processors. As a prerequisite, we
propose a framework for specifying dynamic, parallel, constant-time programs
that require small amounts of work. This framework is based on the dynamic
descriptive complexity framework by Patnaik and Immerman.
