Artificial intelligent assistant

Deterministic Push-Down Automata Does there exist Deterministic Push-Down Automata for the language below. Any kind of answer will be highly appreciated! $$L =ba^nb^n U bba^nb^{2n}$$

Probably $U$ denotes union, and you mean $L = \\{ ba^nb^n \mid\ n\ge 0\\} \cup \\{ bba^nb^{2n} \mid\ n\ge 0\\}$.

Yes that can be done by a deterministic PDA. The first two letters of the string decide how to handle the remainder of the string. Pushing the $a$'s and popping the $b$'s in appropriate ratio is a standard task.

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy d10a54f6ba9c85aa48c98a49401108bd