Two decidability problems for infinite words
Information Processing Letters
Handbook of theoretical computer science (vol. B)
Economy of description for single-valued transducers
Information and Computation
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
The suffix tree of a tree and minimizing sequential transducers
Theoretical Computer Science
Minimization algorithms for sequential transducers
Theoretical Computer Science
How to decide continuity of rational functions on infinite words
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Finite-State Language Processing
Finite-State Language Processing
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Sur les relations rationnelles
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Minimization of Sequential Transducers
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
The suffix Tree of a Tree and Minimizing Sequential Transducers
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Economy of Description for Single-valued Transducers
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions
PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
Coalgebraising Subsequential Transducers
Electronic Notes in Theoretical Computer Science (ENTCS)
An efficient algorithm to induce minimum average lookahead grammars for incremental LR parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Subsequential transducers: a coalgebraic perspective
Information and Computation
| Hi-index | 5.23 |
We study the determinization of transducers over finite and infinite words. The first part of the paper is devoted to finite words. We recall the characterization of subsequential functions due to Choffrut. We describe here a known algorithm to determinize a transducer.In the case of infinite words, we consider transducers with all their states final. We give an effective characterization of sequential functions over infinite words. We describe an algorithm to determinize transducers over infinite words. This part contains the main novel results of the paper.