A non-ambiguous decomposition of regular languages and factorizing codes
type: Item
instance of: scholarly article
title: A non-ambiguous decomposition of regular languages and factorizing codes
zbMATH Open document ID: 1012.68100
DOI: 10.1016/S0166-218X(02)00193-2
author: Marcella Anselmo
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 1878531
zbMATH Keywords: formal languages
zbMATH Keywords: non-ambiguous factorizations
zbMATH Keywords: codes
zbMATH Keywords: Schützenberger's factorization conjecture
MaRDI profile type: Publication
cites work: A non-ambiguous language factorization problem
cites work: Q4448366
cites work: ON LANGUAGES FACTORIZING THE FREE MONOID
cites work: On some factorization problems
cites work: Motifs et bases de langages
cites work: Centralizers in Free Associative Algebras
cites work: Q4430300
cites work: Q3994777
cites work: Q4502528
cites work: Factorisation des ensembles préfixiels
cites work: On Decompositions of Regular Events
cites work: Q5639639
cites work: Construction of a family of finite maximal codes
cites work: A partial result about the factorization conjecture for finite variable- length codes
cites work: Q4079524
cites work: Parallel concepts in graph theory
cites work: Q4506483
cites work: Q2754174
cites work: Codes limites et factorisations finies du monoïde libre
cites work: Q4942638
cites work: ON THE ROOT OF LANGUAGES
cites work: On Concatenative Decompositions of Regular Events
cites work: Q3942894
cites work: Codes et motifs
cites work: Q3931621
cites work: Noncommutative factorization of variable-length codes
cites work: Q4155837
cites work: On the decomposition of finite languages
cites work: Sur certains sous-monoïdes libres
cites work: Q4348039
Recommended article: Canonical Decomposition of a Regular Factorial Language
Recommended article: A non-ambiguous language factorization problem
Recommended article: Q3787510
Recommended article: Prime Decompositions of Regular Languages
Recommended article: On the computation of quotients and factors of regular languages
Recommended article: A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
Recommended article: Canonical decomposition of catenation of factorial languages
Recommended article: Regular component decomposition of regular languages.
Recommended article: An algorithm for the decomposition of finite languages
Recommended article: Variants of codes and indecomposable languages
description: scientific article; zbMATH DE number 1878531