A non-ambiguous decomposition of regular languages and factorizing codes-Reference-Cited by-同舟云学术

A non-ambiguous decomposition of regular languages and factorizing codes

Published:2003-03 Issue:2-3 Volume:126 Page:129-165
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Anselmo Marcella

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference39 articles.

1. A non-ambiguous language factorization problem;Anselmo,2000

2. Constructing finite maximal codes from Schützenberger Conjecture;Anselmo,2001

3. M. Anselmo, A. Restivo, Factorizing languages, in: B. Pehrson, I. Simon (Eds.), Proceedings of the 13th World Computer Congress IFIP 94, Vol. 1, Elsevier, North-Holland, Amsterdam, 1994, pp. 445–450.

4. On languages factorizing the free monoid;Anselmo;Internat. J. Algebra Comput.,1996

5. On some factorization problems;Anselmo;Bull. Belgian Math. Soc.,1997

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

1. On Unambiguity of Languages Related to Codes;Lecture Notes in Electrical Engineering;2012

2. On factorizing codes: Structural properties and related decision problems;Advances in Applied Mathematics;2007-08

3. FINITE COMPLETIONS VIA FACTORIZING CODES;International Journal of Algebra and Computation;2007-06

4. Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms;Theory of Computing Systems;2005-11-29

5. On a complete set of operations for factorizing codes;RAIRO - Theoretical Informatics and Applications;2005-10-15