One-way Resynchronizability of Word Transducers

被引:0
|
作者
Bose, Sougata [1 ]
Krishna, S. N. [2 ]
Muscholl, Anca [1 ]
Puppis, Gabriele [3 ]
机构
[1] Univ Bordeaux, LaBRI, Bordeaux, France
[2] Indian Inst Technol, Dept Comp Sci & Engn, Bombay, Maharashtra, India
[3] Univ Udine, Dept Math Comp Sci & Phys, Udine, Italy
关键词
String transducers; Resynchronizers; One-way transducers; EQUIVALENCE PROBLEM; 2-WAY; UNSOLVABILITY;
D O I
10.1007/978-3-030-71995-1_7
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The origin semantics for transducers was proposed in 2014, and it led to various characterizations and decidability results that are in contrast with the classical semantics. In this paper we add a further decidability result for characterizing transducers that are close to one-way transducers in the origin semantics. We show that it is decidable whether a non-deterministic two-way word transducer can be resynchronized by a bounded, regular resynchronizer into an origin-equivalent one-way transducer. The result is in contrast with the usual semantics, where it is undecidable to know if a non-deterministic two-way transducer is equivalent to some one-way transducer.
引用
下载
收藏
页码:124 / 143
页数:20
相关论文
共 50 条