On finitely generated monoids of matrices with entries in $\mathbb {N}$
RAIRO-Theor. Inf. Appl., 25 1 (1991) 19-38
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 Nonnegative Integer Matrices and Short Killing Words
Stefan Kiefer and Corto N. MascleSIAM Journal on Discrete Mathematics 35 (2) 1252 (2021)
https://doi.org/10.1137/19M1250893
Tools and Algorithms for the Construction and Analysis of Systems
Marius Bozga, Radu Iosif and Filip KonečnýLecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems 7214 252 (2012)
https://doi.org/10.1007/978-3-642-28756-5_18
Exponential upper and lower bounds for the order of a regular language
Andreas WeberTheoretical Computer Science 134 (1) 253 (1994)
https://doi.org/10.1016/0304-3975(94)90288-7
Distance automata having large finite distance or finite ambiguity
Andreas WeberMathematical Systems Theory 26 (2) 169 (1993)
https://doi.org/10.1007/BF01202281
The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
J. L. LambertRAIRO - Theoretical Informatics and Applications 26 (5) 425 (1992)
https://doi.org/10.1051/ita/1992260504251
A note on finitely ambiguous distance automata
Hing LeungInformation Processing Letters 44 (6) 329 (1992)
https://doi.org/10.1016/0020-0190(92)90109-9
On the degree of ambiguity of finite automata
Andreas Weber and Helmut SeidlTheoretical Computer Science 88 (2) 325 (1991)
https://doi.org/10.1016/0304-3975(91)90381-B