Skip to main content

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

  • 335 Accesses

Abstract

In this paper we consider an operation of inserting contexts in a word controlled by a contextual scheme X which provides a selection criterion for contextual insertion. We say that a language L is k-stable w.r.t. a contextual scheme X if by making any k context insertions in a word of L we still obtain a word of L; L is k-anti-stable w.r.t. X if by making any k context insertions in a word of L we get a word not in L; L is called k-error-correctable w.r.t. X if by making any k context insertions in a word x of L we get either a word in L or a word not in L which cannot be also obtained by making k context insertions in a word z of L different from x. We prove that all these properties are decidable for regular languages. We then define a distance between two words that measures the minimal number of context insertions in one of the words in order to obtain the other. Some properties of this distance, which is actually a semimetric, are investigated.

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. Dieffenbach, C.W., Dveksler, G.S. (eds.): A Laboratory Manual. Cold Spring Harbor Laboratory Press (1995)

    Google Scholar 

  2. Kari, L., Thierrin, G.: Contextual Insertions/Deletions and Computability. Information and Computation 131, 47–61 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Karlin, S., Mocarski, E.S., Schachtel, G.A.: Molecular Evolution of Herpesviruses: Genomic and Protein Comparisons. J. of Virology 68, 1886–1902 (1994)

    Google Scholar 

  4. van Lindt, J.H.: Introduction to Coding Theory. Springer, Berlin (1982)

    Google Scholar 

  5. Marcus, S.: Contextual Grammars. Rev. Roum. Math. Pures Appl. 14, 1525–1534 (1969)

    MathSciNet  MATH  Google Scholar 

  6. Marcus, S.: Contextual Grammars and Natural Languages. In: Rozenberg, G., Salomaa, A. (eds.) The Handbook of Formal Languages, pp. 215–235. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  7. Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: Lexical Analysis With Simple Finite-Fuzzy-Automaton Model. J. Universal Computer Science 1, 288–307 (1996)

    MATH  Google Scholar 

  8. McGeoch, D.J.: Molecular Evolution of Large DNA Viruses of Eukaryotes. Seminars in Virology 3, 399–408 (1992)

    Google Scholar 

  9. Mitrana, V.: Contextual Insertion and Deletion. In: Păun, G. (ed.) Mathematical Linguistics and Related Topics, pp. 271–278. The Publishing House of the Romanian Academy (1994)

    Google Scholar 

  10. Oflezer, K.: Error-Tolerant Finite State Recognition. In: Proceedings of the Fourth International Workshop on Parsing Technologies, Prague, pp. 196–207 (September 20-24, 1995)

    Google Scholar 

  11. Păun, G.: Marcus Contextual Grammars. Kluwer, Dordrecht (1997)

    Book  MATH  Google Scholar 

  12. Rozenberg, G., Salomaa, A. (eds.): The Handbook of Formal Languages. Springer, Heidelberg (1997)

    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 chapter

Cite this chapter

Bottoni, P., Gramatovici, R., Labella, A., Manea, F., Mitrana, V. (2011). Context Insertions. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20000-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19999-8

  • Online ISBN: 978-3-642-20000-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics