I am looking for a proof for the following problem:For languages $L$ and $R$, if $L$ is deterministic context-free  and $R$ is regular, then $LR$ is a deterministic context-free  language.Note: $RL$ may not satisfy this condition, e.g. if $L=\{wcw^R\mid w\in (a|b)^*\}$, and $R=\{a\}^*$.
Deterministic context-free languages are closed under regular right-product
formal languages;context free;closure properties;pushdown automata