Rational series and their languages
Rational series and their languages
Construction of a family of finite maximal codes
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
A partial result about the factorization conjecture for finite variable-length codes
Discrete Mathematics
On Decompositions of Regular Events
Journal of the ACM (JACM)
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Some Decision Results for Recognizable Sets in Arbitrary Monoids
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On Codes Having no Finite Completion
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The Commutation of Finite Sets: a Challenging Problem
The Commutation of Finite Sets: a Challenging Problem
| Hi-index | 0.04 |
Given languages Z,L ⊆ Σ*, Z is L-decomposable (finitely L-decomposable, resp.) if there exists a non-trivial pair of languages (finite languages, resp.) (A,B), such that Z =AL + B and the operations are non-ambiguous. We show that it is decidable whether Z is L-decomposable and whether Z is finitely L-decomposable, in the case Z and L are regular languages. The result in the case Z=L allows one to decide whether, given a finite language S ⊆ Σ*, there exist finite languages C,P such that SC*P = Σ* with non-ambiguous operations. This problem is related to Schützenberger's Factorization Conjecture on codes. We also construct an infinite family of factorizing codes.