Aspects of shuffle and deletion on trajectories

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 47-61

  Kari, Lila ^a   Sosík, Petr ^a,b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b SILESIAN UNIVERSITY IN OPAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; ITERATIVE METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

BINARY WORD OPERATIONS; BIPOLAR DELETION; FORMAL LANGUAGE THEORY; SEQUENTIAL INSERTION;

SET THEORY;

EID: 13644263501     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.038     Document Type: Article

References (22)

1. M. Domaratzki, Deletion along trajectories, Tech. Report 2003-464, School of Computing, Queen's University, 2003; Theoret. Comput. Sci. 320 (2004) 293-313.
2. M. Domaratzki, Deletion along trajectories, Tech. Report 2003-464, School of Computing, Queen's University, 2003; Theoret. Comput. Sci. 320 (2004) 293-313.
3. M. Domaratzki, Splicing on routes versus shuffle and deletion along trajectories, Tech. Report 2003-471, School of Computing, Queen's University, 2003.
4. M. Domaratzki, and K. Salomaa Decidability of trajectory-based equations J. Fiala V. Koubek J. Kratochvíl Mathematical Foundations of Computer Science 2004, Lecture Notes in Computer Science Vol. 3153 2004 Springer Berlin 723 734
5. M. Domaratzki, A. Mateescu, K. Salomaa, S. Yu, Deletion on trajectories and commutative closure, in: T. Harju, J. Karhumaki (Eds.), WORDS'03: Fourth Internat. Conf. on Combinatorics on Words, TUCS General Publication No. 27, August 2003, pp. 309-319.
6. M. Ito, L. Kari, and G. Thierrin Shuffle and scattered deletion closure of languages Theoret. Comput. Sci. 245 2000 115 133
7. L. Kari On insertion and deletion in formal languages, Ph.D. Thesis 1991 University of Turku Finland
8. L. Kari On language equations with invertible operations Theoret. Comput. Sci. 132 1994 129 150
9. L. Kari, S. Konstantinidis, Language equations, maximality and error detection, J. Comput. System Sci., to appear.
10. L. Kari, S. Konstantinidis, and P. Sosík Bond-free languages formalizations, maximality and construction methods C. Feretti G. Mauri C. Zandron DNA 10, Tenth Internat. Meeting on DNA Computing, Milano 2004 University of Milano-Bicocca 16 25
11. L. Kari, S. Konstantinidis, and P. Sosík Preventing undesirable bonds between DNA codewords C. Feretti G. Mauri C. Zandron DNA 10, Tenth Internat. Meeting on DNA Computing, Milano 2004 University of Milano-Bicocca 375 384
12. L. Kari, S. Konstantinidis, and P. Sosík Substitutions on trajectories J. Karhumäki H. Maurer G. P̌un G. Rozenberg Theory is Forever. Essays Dedicated to A. Salomaa on the Occasion of His 70th Birthday, Lecture Notes in Computer Science Vol. 3113 2004 Springer Berlin 145 158
13. L. Kari, and P. Sosík On language equations with deletion Bull. EATCS 83 2004 173 180
14. L. Kari, P. Sosík, Language deletion on trajectories, Dept. of Computer Science Tech. Report No. 606, University of Western Ontario, London, 2003.
15. E.L. Leiss Language Equations 1999 Springer New York
16. C. Martin-Víde, A. Mateescu, G. Rozenberg, A. Salomaa, Contexts on trajectories, TUCS Tech. Report No. 214, Turku Centre for Computer Science, 1998.
17. A. Mateescu, A. Salomaa, Nondeterministic trajectories, Formal and natural computing: essays dedicated to Grzegorz Rozenberg, Lecture Notes in Computer Science, Vol. 2300, 2002, pp. 96-106.
18. A. Mateescu, K. Salomaa, and S. Yu On fairness of manydimensional trajectories J. Automata Languages and Combin. 5 2000 145 157
19. A. Mateescu, G. Rozenberg, A. Salomaa, Shuffle on trajectories: syntactic constraints, TUCS Tech. Report No. 41, Turku Centre for Computer Science, 1996; Theoret. Comput. Sci. 197 (1998) 1-56.
20. A. Mateescu, G. Rozenberg, A. Salomaa, Shuffle on trajectories: syntactic constraints, TUCS Tech. Report No. 41, Turku Centre for Computer Science, 1996; Theoret. Comput. Sci. 197 (1998) 1-56.
21. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997.
22. A. Salomaa Theory of Automata 1969 Pergamon Press Oxford