On the minimal automaton of the shuffle of words and araucarias

Lecture Notes in Computer Science

Volumn 3354, Issue , 2005, Pages 316-327

  Schott, René ^a   Spehner, Jean Claude ^b  

^a LORIA   (France)

^b UNIVERSITÉ DE HAUTE ALSACE   (France)

Author keywords

Automaton; Shuffle of words; Trees

Indexed keywords

TREES (MATHEMATICS); WORD PROCESSING;

ARAUCARIAS; AUTOMATON; LETTERS; SHUFFLE OF WORDS;

AUTOMATA THEORY;

EID: 24144470027     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_26     Document Type: Conference Paper

References (16)

1. Allauzen C., Calcul efficace du shuffle de k mots, Prépublication de l'Institut Gaspard Monge, 36, 2000.
2. Berstel J. and Boasson L., Shuffle factorization is unique, Prépublication de l'Institut Gaspard Monge, 16, 1999.
3. Cori R. and Perrin D., Automates et commutations partielles, RAIRO Inf. Theor., 19, 1985, 21-32.
4. Diekert V., Combinatorics of traces, Lecture Notes in Computer Science, 454, Springer Verlag, 1990.
5. Eilenberg S., Automata, Languages and Machines, Academic Press, 1974.
6. Prançon J., Une approche quantitative de l'exclusion mutuelle, Theoretical Informatics and Applications, 20, 3 (1986) 275-289.
7. Gómez A. C. and Pin J.-E., On a conjecture of Schnoebelen, Lecture Notes in Computer Science, 2710 (2003), 35-54.
8. Lothaire M., Combinatorics on words, Addison-Wesley, Reading, MA, 1982.
9. Mateescu A., Shuffle of ω-words: algebraic aspects, Proceedings of STACS 98, Lecture Notes in Computer Science, 1373, 150-160, Springer Verlag 1998.
10. Nivat M., Ramkumar G.D.S., Pandu Rangan C., Saoudi A., and Sundaram R., Efficient parallel shuffle recognition, Parallel Processing Letters, 4, 455-463, 1994.
11. Schnoebelen P., Decomposable regular languages and the shuffle operator, EATCS Bull., 67, 1999, 283-289.
12. Schott R. and Spehner J.-C., Efficient generation of commutation classes, Journal of Computing and Information, 2, 1, 1996, 1110-1132.
13. Special issue: Proceedings of Eighth International Conference of Computing and Information (ICCI'96), Waterloo, Canada, June 19-22, 1996.
14. Schott R. and Spehner J.-C., Two optimal parallel algorithms on the commutation class of a word, Theoretical Computer Science, 324, 107-131, 2004.
15. Spehner J.-C., Le calcul rapide des mélanges de deux mots, Theoretical Computer Science, 47 (1986), 181-203.
16. Zielonka W., Notes on finite asynchronous automata and trace languages, RAIRO Inf. Theor., 21, 1987, 99-135.