Determinization of transducers over finite and infinite words.
type: Item
instance of: scholarly article
title: Determinization of transducers over finite and infinite words.
zbMATH Open document ID: 1061.68088
DOI: 10.1016/S0304-3975(01)00271-7
author: Marie-Pierre Béal
author: Olivier Carton
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1857063
zbMATH Keywords: Automata
zbMATH Keywords: Transducers
zbMATH Keywords: Infinite words
zbMATH Keywords: Determinization
MaRDI profile type: Publication
cites work: Computing the prefix of an automaton
cites work: Q2754176
cites work: Q4508395
cites work: Q3859267
cites work: Single-valued a-transducers
cites work: The suffix tree of a tree and minimizing sequential transducers
cites work: Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
cites work: Q3853135
cites work: On-line finite automata for addition in some numeration systems
cites work: Two decidability problems for infinite words
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Minimization algorithms for sequential transducers
cites work: How to decide continuity of rational functions on infinite words
cites work: Q4101446
cites work: Sur une variante des fonctions séquentielles
cites work: Q4385530
cites work: Q4942629
cites work: Economy of description for single-valued transducers
full work available at URL: s0304-3975(01)00271-7
OpenAlex ID: W2039511338
description: scientific article; zbMATH DE number 1857063