Skip to main content
SpringerLink
Log in

Parikh Matrices and Words Over Ternary Alphabet

  • Conference paper
  • First Online:
Proceedings of Fourth International Conference on Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 335))

  • 1340 Accesses

Abstract

In this paper, Parikh matrices over ternary alphabet are investigated. Algorithm is developed to display Parikh matrices of words over ternary alphabet. A set of equations for finding ternary words from the respective Parikh matrix is discussed. A theorem regarding the relations of the entries of the 4 × 4 Parikh matrices is proved. Some other results in this regard are also discussed. Significance of graphical representation of binary amiable words is given. Extension of this notion for ternary amiable words is introduced.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Parikh, R.J.: On the context-free languages. J. Assoc. Comput. Mach. 13, 570–581 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  2. Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A sharpening of the Parikh mapping theoret. Inf. Appl. 35, 551–564 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: On an extension of the Parikh mapping. T.U.C.S Technical Report No. 364 (2000)

    Google Scholar 

  4. Subramanian, K.G., Huey, A.M., Nagar, A.K.: On Parikh matrices. Int. J. Found. Comput. Sci. 20(2), 211–219 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ding, C., Salomaa, A.: On some problems of Mateescu concerning sub word occurences. Fundamenta Informaticae 72, 1–15 (2006)

    MathSciNet  Google Scholar 

  6. Atanasiu, A., Vide, C.M., Mateescu, A.: On the injectivity of the Parikh matrix mapping Fundam. Informa 46, 1–11 (2001)

    Google Scholar 

  7. Salomaa, A., et al.: Subword conditions and subword histories. Inf. Comput. 204, 1741–1755 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bhattacharjee, A., Purkayastha, B.S.: Parikh matrices and words over tertiary ordered alphabet. Int. J. Comput. Appl. 85(4), 10–15 (2014)

    Google Scholar 

  9. Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68, 1–21 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theoret. Comput. Sci. 390, 102–109 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Atanasiu, A.: Binary amiable words. Int. J. Found. Comput. Sci 18(2), 387–400 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  12. Bhattacharjee, A., Purkayastha, B.S.: Application of ratio property in searching of M-ambiguous words and its generalization. In: Proceedings of Third International Conference on Soft computing for Problem Solving, SocProS 2013, AISC, vol. 258, pp. 857–865. Springer, India (2014)

    Google Scholar 

  13. Bhattacharjee, A., Purkayastha, B.S.: Some alternative ways to find M-ambiguous binary words corresponding to a Parikh matrix. Int. J. Comput. Sci. Appl. AIRCC 4(1), 53–64 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Assam University, Silchar, 788011, India

    Amrita Bhattacharjee & Bipul Syam Purkayastha

Authors
  1. Amrita Bhattacharjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bipul Syam Purkayastha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amrita Bhattacharjee .

Editor information

Editors and Affiliations

  1. Mathematics, National Institute of Technology Silchar, Silchar, Assam, India

    Kedar Nath Das

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India

    Kusum Deep

  3. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

  4. Department of Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  5. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Bhattacharjee, A., Purkayastha, B.S. (2015). Parikh Matrices and Words Over Ternary Alphabet. In: Das, K., Deep, K., Pant, M., Bansal, J., Nagar, A. (eds) Proceedings of Fourth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 335. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2217-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2217-0_12

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2216-3

  • Online ISBN: 978-81-322-2217-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation