The language recognized by a cellular automaton is the set of the accepted initial configurations. For one-dimensional bounded cellular automata, the recognizable languages are the context-sensitive languages. This paper is focused on languages identified by one-dimensional cellular automata within a fixed number of steps. It is shown that such languages are precisely the finite unions of subword composable languages. L is subword composable if :9I It is shown that L is subword composable is decidable. Finally, it is shown that the languages acceptable in constant time by one dimensional nondeterministic c.a. are precisely the regular languages.