I need help on this question Please provide a clear explaina

I need help on this question. Please provide a clear explaination in the solution. Thank you!

Construct a DPDA (yes, deterministic DPA) to accept language {0^n 1^3n: n greaterthanorequalto 1}. You need write down the explicit construction. Explicit construction == Psuedo-code in the form of delta or instructions like \"on state p, when read a, the top of stack is b, the next move is to.....\"

Solution

An inner reference DAC that, for contrast with VREF, supplies the comparator with an analog voltage equal to the digital code output of the SARin.
The successive approximation check in is initialized so that the most tremendous bit (MSB) is same to a digital 1. This code is fed into the DAC, which then substances the analog equal of this digital code (Vref/2) into the comparator circuit for comparison with the sampled enter voltage. If this analog voltage exceeds Vin the comparator causes the SAR to reset this bit; otherwise, the bit is left a 1. Then the subsequent bit is ready to at least one and the same take a look at is done, persevering with this binary search until each bit within the SAR has been tested. The resulting code is the digital approximation of the sampled input voltage and is sooner or later output by means of the SAR at the give up of the conversion (EOC).

Mathematically, let Vin = xVref, so x in [1, 1] is the normalized enter voltage. The goal is to about digitize x to an accuracy of one/2n.