Reduced languages as ω-generators

Authors:
Sandrine Julia;Tran Vinh Duc
Affiliations:
Université de Nice, Sophia Antipolis, Laboratoire I3S, CNRS, Sophia Antipolis Cedex, France;Thang Long School of Technology
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 8
Cited 0

Finitely generated &ohgr;-languages

Information Processing Letters
On generators of rational &ohgr;-power languages

Theoretical Computer Science
Prefix-free languages as &ohgr;-generators

Information Processing Letters
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Free submonoids and minimal &ohgr;-generators of R&ohgr;

Acta Cybernetica
On codes, &ohgr;-codes and &ohgr;-generators

Information Processing Letters
Generators with bounded deciphering delay for rational &ohgr;-Languages

Automatica (Journal of IFAC)
Theory of Codes

Theory of Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following decision problem: "Is a rational ω-language generated by a code ?" Since 1994, the codes admit a characterization in terms of infinite words. We derive from this result the definition of a new class of languages, the reduced languages. A code is a reduced language but the converse does not hold. The idea is to "reduce" easy-to-obtain minimal ω-generators in order to obtain codes as ω-generators.