- Full text PDF available (7)
A context>free phrase structure general~or is in..~landard jb~'m if and only if alt of its rules are of the form: Z-, aY~, ... , Y,~ where Z and Yi are intermediate symbels and a is a l~erminM symbol, so that one input., symbol is processed at each step. Standard form is eonvenien(~ for computer manipulation of eontext-free languages. A proof is given that… (More)
A deterministic pushdown store automaton ~s superdetermm~suc if it is finite delay, and whenever two accessible configurations c~ and c~ in the same state and m reading mode are taken by the same input into two configurations c, and c', m reading mode, then c, and c'_, are also m the same state and the change m stack height between c, and c_, is the same as… (More)
A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequential transduction preserves the former; set complementation, the latter. Several solvability questions are also considered.