I need to give an example of a language $B$ is $NL-complete$ where $B^* \in L$.
I know $PATH$ is $NL-complete$ (but not limited to using other languages).
I am clueless about that. I know $L$ is not closed under $^*$ so there must a language like that.
Any help would be appreciated.