Abstract
We described here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Béal, M. P., Carton, O., Prieur, C., & Sakarovitch, J. (2000). Squaring transducers: An efficient procedure for deciding functionality and sequentiality of transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 397–406). https://doi.org/10.1007/10719839_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
