Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theoretical Computer Science and Discrete Mathematics

ICTCSDM 2016: Theoretical Computer Science and Discrete Mathematics pp 98–105Cite as

Dissecting Power of Certain Matrix Languages

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10398))

Abstract

In formal language theory, the Siromoney matrix grammars generate matrix languages. They are two dimensional languages which are \(m \times n\) arrays of terminals. In string languages, the ability of a regular language to dissect an infinite language into two partitions of infinite size has already been studied under the dissecting power of regular languages. In this paper we extend this special dissecting capacity of certain classes of string languages to matrix languages. The results demonstrate the matrix dissectibility of certain classes of matrix languages like infinite recursive matrix languages, constantly growing matrix languages (CGML), languages that are not CGML immune and CF:CF Siromoney matrix languages. In this paper the objectives of the study, extension methodology and results are discussed in detail.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory. Languages and Computation, 3rd edn. Addison-Wesley, Boston (2006)

    MATH  Google Scholar 

  2. Krithivasan, K., Siromoney, R.: Characterizations of regular and context free matrices. Int. J. Comput. Math. 4(1–4), 229–445 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  3. Parikh, R.: On context free languages. J. ACM. B. 13(4), 570–581 (1961)

    Article  MATH  Google Scholar 

  4. Radhakrishnan, V., Chakravarthy, V., Krithivasan, K.: Pattern matching in matrix grammars. J. Autom. Lang. Comb. 3(1), 59–76 (1998)

    MATH  MathSciNet  Google Scholar 

  5. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  6. Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract family of matrices and picture language. Comput. Graph. Image Process. 1, 284–307 (1972)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Steibe, R.: Slender siromoney matrix languages. Inf. Comput. 206, 1248–1258 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Yamakami, T., Kato, Y.: The dissecting power of regular languages. Inf. Process. Lett. 113, 116–122 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Easwari Engineering College, Chennai, 600 089, India

    J. Julie

  2. Department of Mathematics, Anna University, MIT Campus, Chennai, 600 044, India

    J. Baskar Babujee

  3. Department of Computer Science and Engineering, Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, Chennai, 600 127, India

    V. Masilamani

Authors
  1. J. Julie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Baskar Babujee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Masilamani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Julie .

Editor information

Editors and Affiliations

  1. Kalasalingam University, Krishnankoil, India

    S. Arumugam

  2. Ball State University, Muncie, Indiana, USA

    Jay Bagga

  3. Indiana University – Purdue University, Fort Wayne, Indiana, USA

    Lowell W. Beineke

  4. Indian Institute of Technology, New Delhi, India

    B.S. Panda

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Julie, J., Baskar Babujee, J., Masilamani, V. (2017). Dissecting Power of Certain Matrix Languages. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64419-6_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64418-9

  • Online ISBN: 978-3-319-64419-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation