Automata model with undecidable (or non-context-sensitive) languages and no $\varepsilon$-transitions.
I do not think it is possible at all. Either such automata cannot be recursively defined, or have to make local non-recursive decisions at nodes. The first case is obviously uninteresting, and the latter is equivalent to having undecidable oracles at nodes.