Without any restriction on transition functions in T , these functions might have an infinite domain, and could thus encode even nonrecursively enumerable languages.
in standard practice for natural language parsing, transitions are always specified by some finite mean.