Skip to main content
Log in

Cut-and-Paste Languages

  • Published:
Grammars

Abstract

The paper introduces the concept of cut-and-paste polynomial function, which models operations on words inspired from contextual languages and DNA computing. Fixed-point equations attached to such functions become generative devices for new classes of languages. The class of first-degree 2CP-languages is shown to be incomparable with the Chomsky hierarchy. We give some examples which motivate further study of higher degree CP-languages.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Baranga, A. The contraction principle as a particular case of Kleene's fixed point theorem, Discrete Mathematics, 98: 75–79, 1991.

    Google Scholar 

  • Baranga, A., and C. Popescu. Ordering, compactness, continuity, Bulletin Mathématique de la Soc. Sci. Math. de la R.S. de Roumanie, Tome 31(79), nr.2: 99–106, 1987.

    Google Scholar 

  • Ceterchi, R. Marcus contextual languages and their cut-and-paste properties, Rough Sets and Current Trends in Computing. In L. Polkowski and A. Skowron, editors, RSCTC'98 Proceedings, 99–106, Springer, 1998a.

  • Ceterchi, R. Characterizing contextual languages with fixed-point equations, Annals of the Bucharest University, Mathematics-Informatics Series, Vol. 47, 41–49, 1998b.

  • Ceterchi, R. Modeling DNA recombinant behavior with fixed-point equations, Computing with Bio-Molecules: Theory and Experiments (Gh. Păun editor), Springer Verlag, Singapore, 340–352, 1998c.

    Google Scholar 

  • Ehrenfeucht, A. Gh. Păun, and G. Rozenberg. Contextual grammars and formal languages, chapter 6 in Handbook of Formal Languages, Springer, G. Rozenberg and A. Salomaa, editors, Vol. 2, 237–293, 1997.

  • Head, T. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology, 49: 737–759, 1987.

    Google Scholar 

  • Head, T. Gh. Păun, and D. Pixton. Language theory and molecular genetics, chapter 7, In Handbook of Formal Languages, Springer, G. Rozenberg and A. Salomaa editors, Vol. 2, 295–360, 1997.

  • Marcus, S. Contextual grammars, Rev. Roum. Math. Pures Appl., 14: 1525–1534, 1969.

    Google Scholar 

  • Marcus, S. Contextual grammars and natural languages, chapter 5, in G. Rozenberg and A. Salomaa editors, Handbook of Formal Languages, Vol. 2, 215–235, Springer-Verlag, Berlin, 1997.

    Google Scholar 

  • Martín-Vide, C. Natural computation for natural language, Fundamenta Informaticae, 31(2): 117–124, 1997.

    Google Scholar 

  • Păun, Gh. Marcus Contextual Grammars, Kluwer Academic Publishers, Dordrecht, Boston, London, 1997.

    Google Scholar 

  • Păun, Gh., G. Rozenberg, and A. Salomaa. DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, Heidelberg, 1998.

    Google Scholar 

  • Rozenberg, G. and A. Salomaa (editors). Handbook of Formal Languages, 3 volumes, Springer-Verlag, Berlin, Heidelberg, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ceterchi, R. Cut-and-Paste Languages. Grammars 2, 179–188 (1999). https://doi.org/10.1023/A:1009919019868

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009919019868