Skip to main content
SpringerLink
Log in

Array splicing systems

  • 4. Splicing Systems
  • Chapter
  • First Online:
New Trends in Formal Languages

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

Abstract

In this paper the concept of splicing is extended to arrays and array or 2D splicing systems are defined. Various subclasses of 2D splicing systems are defined and a restricted class viz. finite simple splicing systems is studied. The hierarchy among the various subclasses of finite simple splicing systems and their relationship to the strictly locally testable languages are established.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Applied Mathematics, 31 (1991), 262–277.

    Google Scholar 

  2. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, EATCS Monographs in Computer Science Vol. 18, Springer-Verlag, 1989.

    Google Scholar 

  3. T. Head, Formal language theory and DNA — an analysis of the generative capacity of specific recombinant behaviours, Bulletin of Mathematical Biology, 49 (1987), 737–759.

    Google Scholar 

  4. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Inc., 1979.

    Google Scholar 

  5. K. Krithivasan, R. Siromoney, Array automata and operations on array languages, International Journal of Computer Mathematics, 4 (1974), Section A, 3–30.

    Google Scholar 

  6. A. De Luca, A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Information and Control, 44 (1980), 300–319.

    Google Scholar 

  7. Gh. Păun, Regular extended H-systems are computationally universal, Journal of Automata, Languages and Combinatorics, 1 (1996), 27–36.

    Google Scholar 

  8. A. Rosenfeld, Picture Languages, Academic Press, New York, 1979.

    Google Scholar 

  9. A. Salomaa, Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

  10. G. Siromoney, R. Siromoney, K. Krithivasan, Abstract families of matrices and picture languages, Computer Graphics and Image Processing, 1 (1972).

    Google Scholar 

  11. G. Siromoney, R. Siromoney, K. Krithivasan, Picture languages with array rewriting rules, Information and Control, 22, 5 (1973).

    Google Scholar 

  12. M. S. Waterman, Introduction to Computational Biology: Maps, Sequences and Genomes, Chapman & Hall, London, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras Chennai, India

    Kamala Krithivasan & Venkatesan T. Chakaravarthy

  2. Department of Mathematics, Indian Institute of Technology, 600 036, Madras Chennai, India

    Raghavan Rama

Authors
  1. Kamala Krithivasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Venkatesan T. Chakaravarthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raghavan Rama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Krithivasan, K., Chakaravarthy, V.T., Rama, R. (1997). Array splicing systems. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62844-6

  • Online ISBN: 978-3-540-68703-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation