A note on time hierarchies for reasonable semantic classes without advice

We show time hierarchies for reasonable semantic classes without advice by eliminating the constant bits of advice in previous results.The elimination is done by a contrapositive argument that for any reasonable computational model,let $\text{CTIME}(f(n))\mathrm{/}g(n)$ denote the set of all languages decide by machines running in time $O(f(n))$ with advice of $g(n)$ bits in that model, if $\text{CTIME}(t(n))\subseteq \text{CTIME}(T(n))\mathrm{/}A(n)$ then $\text{CTIME}(t(n))\mathrm{/}a\subseteq \text{CTIME}(T(n))\mathrm{/}a+2^{a}A(n)$ where $a$ is a constant integer.