Skip to main content

Shuffle on Trajectories over Finite Array Languages

  • Conference paper
Book cover Combinatorial Image Analysis (IWCIA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6636))

Included in the following conference series:

Abstract

Parallel composition of words and languages of words appear as a fundamental operation in parallel computation and in the theory of concurrency. Shuffle on trajectories provides a method to handle the operation of parallel composition. In this paper we study the impact of shuffle on trajectories on various finite arrays. We obtain interesting results yielding new pictures and patterns. We compare this model with the other existing models.

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

Access this chapter

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. Kadrie, A., Rajkumar Dare, V., Thomas, D.G., Subramanian, K.G.: Algebraic properties of the shuffle over omega-trajectories. Inf. Process. Lett. 80(3), 139–144 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dare, V.R., Subramanian, K.G., Thomas, D.G., Siromoney, R.: Infinite arrays and recognizability. International Journal of Pattern Recognition and Artificial Intelligence 14(4), 525–536 (2000)

    Article  Google Scholar 

  3. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3, pp. 215–267. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Helen Chandra, P., Martin-Vide, C., Subramanian, K.G., Van, D.L., Wang, P.S.P.: Parallel contextual array grammars and trajectories. In: Chen, C.H., Wang, P.S.P. (eds.) Handbook of Pattern Recognition and Computer Vision, 3rd edn., pp. 55–70. World Scientific, Singapore (2004)

    Google Scholar 

  5. Helen Chandra, P., Subramanian, K.G., Thomas, D.G.: Parallel contextual array grammars and languages. Electronic Notes in Discrete Mathematics 14, 537–550 (2000)

    Google Scholar 

  6. Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Computer Graphics and Image Processing. I, 284–470 (1972)

    Google Scholar 

  7. Siromoney, G., Siromoney, R., Krithivasan, K.: Picture Languages with array rewriting rules. Information and Control 22, 447–470 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theoretical Computer Science 197, 1–56 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geetha, H., Thomas, D.G., Kalyani, T., Venkatesan, A.S.P. (2011). Shuffle on Trajectories over Finite Array Languages. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds) Combinatorial Image Analysis. IWCIA 2011. Lecture Notes in Computer Science, vol 6636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21073-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21073-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21072-3

  • Online ISBN: 978-3-642-21073-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics