The Question:
A language transformer function $f(L) = \{ssss \ | \ s \in L\}$
Is $f(A)$ regular if A is a regular language?
I don't know how to start solving the question.
A language transformer function $f(L) = \{ssss \ | \ s \in L\}$
Is $f(A)$ regular if A is a regular language?
I don't know how to start solving the question.
Copyright © 2021 JogjaFile Inc.