A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Shuffle on trajectories: The Schutzenberger product and related operations
Tekijät: Harju T, Mateescu A, Salomaa A
Julkaisuvuosi: 1998
Lehti:: Lecture Notes in Computer Science
Tietokannassa oleva lehden nimi: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 1450
Aloitussivu: 503
Lopetussivu: 511
Sivujen määrä: 9
ISBN: 3-540-64827-5
ISSN: 0302-9743
Tiivistelmä
We investigate the problem of finding monoids that recognize languages of the form L-1 (sic)T L-2, where T is an arbitrary set of trajectories. Thereby, we describe two such methods: one based on the so-called trajectories monoids and the other based on monoids of matrices. Many well-known operations such as catenation, bi-catenation, shuffle, literal shuffle and insertion are just particular instances of the operation (sic)(T). Hence, our results offer a uniform treatment for classical methods, notably the Schutzenberger product. We also investigate some other related operations.
We investigate the problem of finding monoids that recognize languages of the form L-1 (sic)T L-2, where T is an arbitrary set of trajectories. Thereby, we describe two such methods: one based on the so-called trajectories monoids and the other based on monoids of matrices. Many well-known operations such as catenation, bi-catenation, shuffle, literal shuffle and insertion are just particular instances of the operation (sic)(T). Hence, our results offer a uniform treatment for classical methods, notably the Schutzenberger product. We also investigate some other related operations.
Turun yliopiston Tutkimustietojärjestelmän portaali