On a conjecture of schnoebelen

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2710, Issue , 2003, Pages 35-54

  Cano Gómez, Antonio ^a   Pin, Jean Éric ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

FINITE SET;

COMPUTATIONAL LINGUISTICS;

EID: 35248894793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (7)

1. J.C.M. Baeten and W.P. Weijland. Process algebra, volume 18 of Cambridge Tract in Theoretical Computer Science. Cambridge University Press, Cambridge UK, 1990.
2. John H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
3. Samuel Eilenberg. Automata, Languages and Machines, volume B. Academic Press, New York, 1976.
4. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and its Applications. aw, reading, 1983.
5. Jean-Éric Pin. Polynomial closure of group languages and open sets of the hall topology. Theoretical Computer Science, 169:185-200, 1996.
6. Jean-Eric Pin and Pascal Weil. Polynomial closure and unambiguous product. Theory Comput. Systems, 30:1-39, 1997.
7. Ph. Schnoebelen. Decomposable regular languages and the shuffle operator. EATCS Bull, (67):283-289, 1999.