Squaring transducers: an efficient procedure for deciding functionality and sequentiality

We describe 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 follo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2003-01, Vol.292 (1), p.45-63
Hauptverfasser:	Béal, Marie-Pierre, Carton, Olivier, Prieur, Christophe, Sakarovitch, Jacques
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer Science Computer science control theory systems Data Structures and Algorithms Exact sciences and technology Finite automata Functional transducer Sequential transducer Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!