Single-Valued a-Transducers
暂无分享,去创建一个
A single-valued a -transducer is an a -transducer for which the transduction relation is a partial function on strings. Our concern is with questions of decidability and with the structure of input strings (and the associated output strings) that are accepted via more than one path. The main results are: Single-valuedness is decidable. Equivalence of single-valued a -transducers is decidable. For an a -transducer multipath-input strings which pass through loops must pass through loops whose inputs satisfy commutativity conditions and when the a -transducer is single-valued the outputs of the loops must satisfy similar conditions.
[1] Timothy V. Griffiths. The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.
[2] Maurice Nivat,et al. Transduction des langages de Chomsky , 1968 .
[3] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.