Determinization of transducers over finite and infinite words.
From MaRDI portal
Publication:1853526
DOI10.1016/S0304-3975(01)00271-7zbMath1061.68088OpenAlexW2039511338MaRDI QIDQ1853526
Marie-Pierre Béal, Olivier Carton
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00271-7
Related Items (16)
Multi-sequential Word Relations ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Degree of Sequentiality of Weighted Automata ⋮ Sequentiality of group-weighted tree automata ⋮ Multi-Sequential Word Relations ⋮ On the computation of covert channel capacity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finite transducers and rational transductions ⋮ Detectability of labeled weighted automata over monoids ⋮ Disambiguation of weighted tree automata ⋮ A Pattern Logic for Automata with Outputs ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ Coalgebraising Subsequential Transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two decidability problems for infinite words
- The suffix tree of a tree and minimizing sequential transducers
- Sur une variante des fonctions séquentielles
- Single-valued a-transducers
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Minimization algorithms for sequential transducers
- How to decide continuity of rational functions on infinite words
- Economy of description for single-valued transducers
- Computing the prefix of an automaton
- On-line finite automata for addition in some numeration systems
- An Introduction to Symbolic Dynamics and Coding
This page was built for publication: Determinization of transducers over finite and infinite words.
