On the Commutative Equivalence of Bounded Semi-linear Codes-Reference-Cited by-同舟云学术

On the Commutative Equivalence of Bounded Semi-linear Codes

Published:2019 Issue: Volume: Page:119-132
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Carpi Arturo,D’Alessandro Flavio

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-28796-2_9

Reference29 articles.

1. Béal, M.-P., Perrin, D.: On the generating sequences of regular languages on $$k$$ k symbols. J. ACM 50, 955–980 (2003)

2. Boasson, L., Restivo, A.: Une Caractérisation des Langages Algébriques Bornés. ITA 11, 203–205 (1977)

3. Baron, G., Kuich, W.: The characterization of nonexpansive grammars by rational power series. Inf. Control 48, 109–118 (1981)

4. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press, Cambridge (2009)

5. Bridson, M.R., Gilman, R.H.: Context-free languages of sub-exponential growth. J. Comput. Syst. Sci. 64, 308–310 (1999)

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

1. Preliminary Results of Group Detection Technique Based on User to Vector Encoding;Computational Science and Its Applications – ICCSA 2023 Workshops;2023

2. On the Commutative Equivalence of Algebraic Formal Series and Languages;International Journal of Foundations of Computer Science;2021-01-13

3. On bounded linear codes and the commutative equivalence;Theoretical Computer Science;2021-01

4. Lyndon Words, the Three Squares Lemma, and Primitive Squares;String Processing and Information Retrieval;2020