On finitely generated monoids of matrices with entries in $\mathbb {N}$-Reference-Cited by-同舟云学术

On finitely generated monoids of matrices with entries in $\mathbb {N}$

Published:1991 Issue:1 Volume:25 Page:19-38
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Weber Andreas,Seidl Helmut

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/1991250100191/pdf

Reference20 articles.

1. ChI83. CHAN T.-H. and IBARRA O., On the Finite-Valuedness Problem for Sequential Machines, TCS, 1983, 23, pp. 95-101.6930720503.68037

2. E74. EILENBERG S., Automata, Languages, and Machines, Academic Press, New York, N.Y., 1974, A.530382

3. Hs78. HARRISON M., Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978.5263970411.68058

4. HoU79. HOPCROFT J. and ULLMAN J., Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Mass., 1979.6455390426.68001

5. Ja77. JACOB G., Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices, T.C.S., 1977, 5, pp. 183-204.4730750388.15001

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Affine Extensions of Integer Vector Addition Systems with States;Logical Methods in Computer Science;2021-07-20

2. On Nonnegative Integer Matrices and Short Killing Words;SIAM Journal on Discrete Mathematics;2021-01

3. On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words;2019

4. Exponential upper and lower bounds for the order of a regular language;Theoretical Computer Science;1994-11

5. Distance automata having large finite distance or finite ambiguity;Mathematical Systems Theory;1993-06