Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel; C. Reutenauer, Les séries rationnelles et leurs langages, Masson, (1984).
J. Berstel, Transductions and context-free languages, Teubner Verlag, (1979).
T.C. Brown, An interesting combinatorial method in the theory of locally finite semigroups, Pacific J. Math. 36, (1971), 285–289.
Ch. Choffrut, Sur les transductions reconnaissables, RAIRO Informatique Théorique 12, (1978), 203–218.
Ch. Choffrut, Séries rationnelles d'image finie, Rapport L.I.T.P. 79-6, (Jan. 1979).
S. Ginsburg; E. Spanier, Bounded regular sets, Proceedings of the American Mathematical Society, 17, (1966), 1043–1049.
Ph. Gohon, An algorithm to decide whether a rationnal subset of Nk is recognizable, to appear.
K. Hashiguchi, Limitedness theorem on finite automata with distance functions, J. of Computer and System Sciences 24, (1982), 232–244.
A. Salomaa; M. Soittola, Automata-theoretic aspects of formal power series, Springer Verlag, N.Y., (1978).
I. Simon, Limited subsets of a free monoid, Proceedings 19 th Annual Symposium on the Foundations of Computer Science, (1978), 143–150.
H. Straubing, The Burnside problem for semi-groups of matrices, in Combinatorics on words, Progress and Perspectives, L. J. Cummings ed., Academic Press, (1983), 279–295.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mascle, JP. (1986). Torsion matrix semigroups and recognizable transductions. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_74
Download citation
DOI: https://doi.org/10.1007/3-540-16761-7_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16761-7
Online ISBN: 978-3-540-39859-2
eBook Packages: Springer Book Archive