I tried to research the following question with no results: Can you find one example where the following holds true:Let  L = {xxxxxxx} be a deterministic-context-free Language and Let h(...) = xxxxx be a Homomorphism.Then the Homomorphism on that language L h(L) ist NOT a deterministic-CFG anymore.
Deterministic CFL closure Property Homomorphism
reference request;fl.formal languages;context free languages