Rational series and their languages
Rational series and their languages
Construction of a family of finite maximal codes
Theoretical Computer Science
A partial result about the factorization conjecture for finite variable-length codes
Discrete Mathematics
On some Schützenberger conjectures
Information and Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Semirings, Automata and Languages
Semirings, Automata and Languages
Theory of Codes
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Factorizing Codes and Schützenberger Conjectures
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A non-ambiguous decomposition of regular languages and factorizing codes
Discrete Applied Mathematics
| Hi-index | 0.00 |
Sch眉tzenberger Conjecture claims that any finite maximal code C is factorizing, i.e. SC*P = A* in a non-ambiguous way, for some S, P. Let us suppose that Sch眉tzenberger Conjecture holds. Two problems arise: the construction of all (S, P) and the construction of C starting from (S, P). Regarding the first problem we consider two families of possible languages S: S prefix-closed and S s.t. S\ {1} is a code. For the second problem we present a method of constructing C from (S, P), that is relied on the construction of right- and left-factors of a language. Results are based on a combinatorial characterization of right- and left-factorizing languages.