Abstrakt
A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction, see [3, 4, 5]. Its monotone version characterizes the class of deterministic context-free languages (DCFL).
We propose a method for a construction of a deterministic push-down transducer for any monotone reducing automaton which is able with the help of special output symbols to localize its prefix and post-prefix (in)consistencies, and certain types of reducing conflicts.