On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages. - Jonas Schmidt 001; Thomas Schwentick; Jennifer Todtenhoefer (MFCS, 2023)