Decomposing a $k$-valued transducer into $k$ unambiguous ones
RAIRO-Theor. Inf. Appl., 30 5 (1996) 379-413
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the decidability of the valuedness problem for two-way finite transducers
Di-De Yen and Hsu-Chun YenInformation and Computation 285 104870 (2022)
https://doi.org/10.1016/j.ic.2022.104870
Developments in Language Theory
Di-De Yen and Hsu-Chun YenLecture Notes in Computer Science, Developments in Language Theory 11647 100 (2019)
https://doi.org/10.1007/978-3-030-24886-4_7
Query Rewriting for Nondeterministic Tree Transducers
Kazuki MIYAHARA, Kenji HASHIMOTO and Hiroyuki SEKIIEICE Transactions on Information and Systems E99.D (6) 1410 (2016)
https://doi.org/10.1587/transinf.2015FOP0007
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
An. A. Muchnik and K. Yu. GorbunovaProblems of Information Transmission 51 (3) 267 (2015)
https://doi.org/10.1134/S0032946015030059
Language and Automata Theory and Applications
Béatrice Bérard and Olivier CartonLecture Notes in Computer Science, Language and Automata Theory and Applications 8370 149 (2014)
https://doi.org/10.1007/978-3-319-04921-2_12
Lexicographic Decomposition of k-Valued Transducers
Jacques Sakarovitch and Rodrigo de SouzaTheory of Computing Systems 47 (3) 758 (2010)
https://doi.org/10.1007/s00224-009-9206-6
Developments in Language Theory
Rodrigo de SouzaLecture Notes in Computer Science, Developments in Language Theory 5583 478 (2009)
https://doi.org/10.1007/978-3-642-02737-6_39
Developments in Language Theory
Rodrigo de SouzaLecture Notes in Computer Science, Developments in Language Theory 5257 252 (2008)
https://doi.org/10.1007/978-3-540-85780-8_20
Mathematical Foundations of Computer Science 2008
Jacques Sakarovitch and Rodrigo de SouzaLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2008 5162 588 (2008)
https://doi.org/10.1007/978-3-540-85238-4_48
Linearly bounded infinite graphs
Arnaud Carayol and Antoine MeyerActa Informatica 43 (4) 265 (2006)
https://doi.org/10.1007/s00236-006-0022-z
Mathematical Foundations of Computer Science 2005
Arnaud Carayol and Antoine MeyerLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2005 3618 180 (2005)
https://doi.org/10.1007/11549345_17