Squaring transducers: an efficient procedure for deciding functionality and sequentiality

Authors:
Marie-Pierre Béal;Olivier Carton;Christophe Prieur;Jacques Sakarovitch
Affiliations:
Institut Gaspard Monge, Université de Marne-la-Vallée, France;Institut Gaspard Monge, Université de Marne-la-Vallée, France;LIAFA, Université Paris 7/CNRS, France;Laboratoire Traitement et Communication de l'Information ENST/CNRS, Paris, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 9
Cited 15

Economy of description for single-valued transducers

Information and Computation
A proof of Choffrut's theorem on subsequential functions

Theoretical Computer Science
How to decide continuity of rational functions on infinite words

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Codes

Theory of Codes
Determinization of transducers over finite and infinite words

Theoretical Computer Science
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings

Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Subsequential Functions: Characterizations, Minimization, Examples

Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Sur les relations rationnelles

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton

Theoretical Computer Science - Developments in language theory
An optimal pre-determinization algorithm for weighted transducers

Theoretical Computer Science - Implementation and application of automata
Sequential?

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Sequential Automatic Algebras

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
On the Decidability of Bounded Valuedness for Transducers

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Decidability of the Equivalence for k-Valued Transducers

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A combinatorial study of k-valued rational relations

Journal of Automata, Languages and Combinatorics
Deciding the sequentiality of a finitely ambiguous max-plus automaton

DLT'03 Proceedings of the 7th international conference on Developments in language theory
An efficient pre-determinization algorithm

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
On infinitary rational relations and Borel sets

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Properties of visibly pushdown transducers

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the accepting power of 2-tape büchi automata

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

Theoretical Computer Science
Automatic vandalism detection in wikipedia with active associative classification

TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
From Two-Way to One-Way Finite State Transducers

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 follows then for the two decision procedures.