Skip to main content
SpringerLink
Log in

Semantic Shuffle on and Deletion Along Trajectories

  • Conference paper
Developments in Language Theory (DLT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3340))

Included in the following conference series:

Abstract

We introduce semantic shuffle on trajectories (SST) and semantic deletion along trajectories (SDT). These operations generalize the notion of shuffle on trajectories, but add sufficient power to encompass various formal language operations used in applied areas. However, the added power given to SST and SDT does not destroy many desirable properties of shuffle on trajectories, especially with respect to solving language equations involving SST. We also investigate closure properties and decidability questions related to SST and SDT.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cassandras, C., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  2. Daley, M., Ibarra, O., Kari, L.: Closure properties and decision questions of some language classes under ciliate bio-operations. Theor. Comp. Sci. 306 1, 19–38 (2003)

    Article  MathSciNet  Google Scholar 

  3. Daley, M., Kari, L.: Some properties of ciliate bio-operations. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 116–127. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Daley, M., McQuillan, I.: Template-Guided DNA Recombination. In: Proc. 5th Workshop DCFS 2003, pp. 234–244 (2003)

    Google Scholar 

  5. Diekert, V., Métivier, Y.: Partial Commutation and Traces. In: [29], vol. 3, pp. 457–534.

    Google Scholar 

  6. Domaratzki, M.: Deletion along trajectories. Theor. Comp. Sci. 320, 293–313 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Domaratzki, M.: Trajectory-based codes. Acta Inf. 40(6-7), 491–527 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Domaratzki, M.: Trajectory-based embedding relations. Fund. Inf. 59(4), 349–363 (2004)

    MATH  MathSciNet  Google Scholar 

  9. Domaratzki, M., Salomaa, K.: Decidability of trajectory-based equations. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 723–734. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Domaratzki, M., Salomaa, K.: Restricted sets of trajectories and decidability of shuffle decompositions. In: Ilie, L., Wotschke, D. (eds.) Descriptional Complexity of Formal Systems, pp. 37–51 (2004)

    Google Scholar 

  11. Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D., Rozenberg, G.: Computation in Living Cells: Gene assembly in ciliates. Springer-Verlag, Heidelberg (2004)

    Google Scholar 

  12. Ginsburg, S., Spanier, E.H.: Bounded regular sets. Proc. Amer. Math. Soc. 17, 1043–1049 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  13. Harju, T., Mateescu, A., Salomaa, A.: Shuffle on trajectories: The schützenberger product and related operations. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 503–511. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Kari, L.: On language equations with invertible operations. Theor. Comp. Sci. 132, 129–150 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kari, L., Konstantinidis, S., and Sosík, P. On properties of bond-free DNA languages. Tech. Rep. 609, Comp. Sci. Dept., Univ. Western Ontario, Submitted for publication (2003)

    Google Scholar 

  16. Kari, L., Konstantinidis, S., and Sosík, P. Bond-free languages Tech. Rep. 2004–001, St. Mary’s University Dept. of Math. and Comp. Sci (2004)

    Google Scholar 

  17. Kari, L., Konstantinidis, S., Sosík, P.: Substitutions, trajectories and noisy channels. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 154–162. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Kari, L., and Sosík, P. Language deletions on trajectories. Tech. Rep. 606, Comp. Sci. Dept., Univ. of Western Ontario, Submitted for publication (2003)

    Google Scholar 

  19. Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Inf. and Comp. 131, 47–61 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kudlek, M., Mateescu, A.: On distributed catenation. Theor. Comp. Sci. 180, 341–352 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  21. Kudlek, M., Mateescu, A.: On mix operation. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 430–439. Springer, Heidelberg (1997)

    Google Scholar 

  22. Latteux, M., Roos, Y.: Synchronized shuffle and regular languages. In: Karhumäki, J., Maurer, H., Pǎun, G., Rozenberg, G. (eds.) Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 35–44. Springer, Heidelberg (1999)

    Google Scholar 

  23. Mateescu, A.: Splicing on routes: a framework of DNA computation. In: Calude, C., Casti, J., Dinneen, M. (eds.) Unconventional Models of Computation, pp. 273–285. Springer, Heidelberg (1998)

    Google Scholar 

  24. Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comp. Sci. 197, 1–56 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  25. Mateescu, A., Salomaa, A.: Parallel composition of words with re-entrant symbols. An. Univ. Bucureşti Mat. Inform. 45(1), 71–80 (1996)

    MathSciNet  Google Scholar 

  26. Mateescu, A., Salomaa, A.: Nondeterministic trajectories. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 96–106. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  27. Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cyb. 15(3), 339–351 (2002)

    MATH  MathSciNet  Google Scholar 

  28. Pin, J.-E., Sakarovitch, J.: Some operations and transductions that preserve rationality. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 277–288. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  29. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer-Verlag, Heidelberg (1997)

    MATH  Google Scholar 

  30. Yu, S.: Regular languages. In: [29] vol. 1, pp. 41–110

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jodrey School of Computer Science, Acadia University, Wolfville, NS, Canada

    Michael Domaratzki

Authors
  1. Michael Domaratzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Computer Science, Institute of Information and Mathematical Sciences, Massey University Albany, Auckland, New Zealand

    Elena Calude

  3. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Michael J. Dinneen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domaratzki, M. (2004). Semantic Shuffle on and Deletion Along Trajectories. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30550-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24014-3

  • Online ISBN: 978-3-540-30550-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation