Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata

被引:0
|
作者
Hundeshagen, Norbert [1 ]
Otto, Friedrich [1 ]
Vollweiler, Marcel [1 ]
机构
[1] Univ Kassel, Fachbereich Elektrotech Informat, D-34109 Kassel, Germany
关键词
LANGUAGES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We associate a transduction (that is, a binary relation) with the characteristic language of a. restarting automaton, and we prove that in this way monotone deterministic restarting automata yield a characterization of pushdown transductions. Then we study the class of transductions that are computed by parallel communicating systems (PC-systems) of monotone deterministic restarting automata. We will see that this class includes all transductions that are computable.
引用
收藏
页码:163 / 172
页数:10
相关论文
共 49 条