In an automata or formal-language problem, which option best represents Post machine?

A. a special type of regular expression B. a simple abstract computing model related to Turing machine computation C. a finite automaton with output only D. a stack-only grammar