Shuffle of words and araucaria trees

Fundamenta Informaticae

Volumn 74, Issue 4, 2006, Pages 579-601

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

^a LORIA   (France)

^b UNIVERSITÉ DE HAUTE ALSACE   (France)

Author keywords

Automaton; Remarkable polynomials; Shuffle of words; Trees

Indexed keywords

AUTOMATA THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; POLYNOMIALS; TREES (MATHEMATICS);

ARAUCARIAS; REMARKABLE POLYNOMIALS; SHUFFLE PRODUCTS;

WORD PROCESSING;

EID: 33845536287     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (18)

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, Theoretical Computer Science, 273, 2002, 47-67.
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. Franç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, 1994, 455-463.
11. Pradeep B. and Siva Ram Murthy C., A constant time string shuffle algorithm on reconfigurable meshes, Internat. J. Comput. Math., 68, 1998, 251-259.
12. Radford D. E., A natural ring basis for the shuffle algebra and an application to group schemes, J. Algebra, 58, 1979, 432-454.
13. Schnoebelen P., Decomposable regular languages and the shuffle operator, EATCS Bull., 67, 1999, 283-289.
14. Schott R. and Spehner J.-C., Efficient generation of commutation classes, Journal of Computing and Information, 2, 1, 1996, 1028-1045. Special issue: Proceedings of Eighth International Conference of Computing and Information (ICCI'96), Waterloo, Canada, June 19-22, 1996.
15. Schott R. and Spehner J.-C., Two optimal parallel algorithms on the commutation class of a word, Theoretical Computer Science, 324, 2004, 107-131.
16. Schott R. and Spehner J.-C., On the minimal automaton of the shuffle of words and araucarias (Extended abstract), Proceedings of MCU-2004 (International Conference on Machines, Computing and Universality, St Petersburg, September 2004), Lecture Notes in Computer Science, 3354, 316-327, Springer Verlag 2005.
17. Spehner J.-C., Le calcul rapide des mélanges de deux mots, Theoretical Computer Science, 47, 1986, 181-203.
18. Zielonka W., Notes on finite asynchronous automata and trace languages, RAIRO Inf. Theor., 21, 1987, 99-135.