Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers

Determinization of transducers over finite and infinite words

Theoretical Computer Science

Is this Finite-State Transducer Sequentiable?

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata

Efficient algorithms for testing the twins property

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)

Deciding sequentiability of finite-state transducers by finite-state pattern-matching

Theoretical Computer Science - Implementation and application automata

Nondeterministic Bimachines and Rational Relations with Finite Codomain

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

p-subsequentiable transducers

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

Nondeterministic Bimachines and Rational Relations with Finite Codomain

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu