Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Rewriting Logic and its Applications

WRLA 2016: Rewriting Logic and Its Applications pp 152–166Cite as

Maximally Parallel Contextual String Rewriting

  • Conference paper
  • First Online:

  • 322 Accesses

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

Abstract

This paper introduces contextual string rewriting as a special kind of parallel string rewriting in which each rule defines a context which is not changed by the application of the rule and can be read (but not modified) by other rules applying concurrently. We study maximal parallel rewriting in this setting and provide a method to encode the computation of a maximally parallel instance for a contextual string rewrite system as a decidable normal form problem for a particular term rewrite system.

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

Notes

  1. 1.

    As signaled by an annonymous reviewer of an earlier draft.

References

  1. Bottoni, P., Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane systems with promoters/inhibitors. Acta Inform. 38(10), 695–720 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187–243 (2002). doi:10.1016/S0304-3975(01)00359-0

    Article  MathSciNet  MATH  Google Scholar 

  3. Dinu, A., Dinu, L.P.: A parallel approach to syllabification. In: Gelbukh, A.F. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 83–87. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30586-6_7. ISBN 3-540-24523-5

    Chapter  Google Scholar 

  4. Dinu, L.P.: On insertion grammars with maximum parallel derivation. Fundam. Inf. 93(4), 357–369 (2009)

    MathSciNet  MATH  Google Scholar 

  5. Galiukschov, B.S.: Semicontextual grammars. In: Matematika Logica i Matematika Linguistika, pp. 38–50. Tallin University (1981)

    Google Scholar 

  6. Hopf, J.-M., Bader, M., Meng, M., Bayer, J.: Is human sentence parsing serial or parallel? Evidence from event-related brain potentials. Cogn. Brain Res. 15(2), 165–177 (2003)

    Article  Google Scholar 

  7. Kari, L., Thierrin, G.: Contextual insertions, deletions, computability. Inf. Comput. 131(1), 47–61 (1996). ISSN 0890-5401

    Article  MathSciNet  MATH  Google Scholar 

  8. Levelt, W.J.M., Indefrey, P.: The speaking mind/brain: where do spoken words come from, pp. 77–93 (2000)

    Google Scholar 

  9. Lindenmayer, A., Rozenberg, G. (eds.): Automata, Languages, Development. North-Holland Publishing Co., Amsterdam (1976)

    MATH  Google Scholar 

  10. Marcus, S.: Contextual grammars. In: Proceedings of the 1969 Conference on Computational Linguistics, pp. 1–18. Association for Computational Linguistics (1969)

    Google Scholar 

  11. Marcus, S.: Contextual grammars and natural languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 215–235. Springer, Heidelberg (1997)

    Google Scholar 

  12. Meseguer, J.: Rewriting logic as a semantic framework for concurrency: a progress report. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331–372. Springer, Heidelberg (1996). ISBN 3-540-61604-7

    Chapter  Google Scholar 

  13. Mitchell, T.M.: Machine Learning, vol. 45, p. 995. McGraw Hill, Burr Ridge (1997)

    MATH  Google Scholar 

  14. Păun, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer Science & Business Media, New York (2012)

    MATH  Google Scholar 

  16. Roşu, G., Şerbănuţă, T.F.: An overview of the \(\mathbb{K}\) semantic framework. J. Log. Algebr. Program. 79(6), 397–434 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Visser, E., Benaissa, Z.A., Tolmach, A.: Building program optimizers with rewriting strategies. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, ICFP 1998, pp. 13–26. ACM, New York (1998). doi:10.1145/289423.289425. ISBN 1-58113-024-4. http://doi.acm.org/10.1145/289423.289425

Download references

Acknowledgement

The authors would like to thank the anonymous reviewers for their valuable feedback and suggestions. Liviu P. Dinu was supported by UEFISCDI, PNII-ID-PCE-2011-3-0959.

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania

    Traian Florin Şerbănuţă & Liviu P. Dinu

Authors
  1. Traian Florin Şerbănuţă
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liviu P. Dinu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Traian Florin Şerbănuţă .

Editor information

Editors and Affiliations

  1. Alexandru Ioan Cuza University , Iasi, Romania

    Dorel Lucanu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Şerbănuţă, T.F., Dinu, L.P. (2016). Maximally Parallel Contextual String Rewriting. In: Lucanu, D. (eds) Rewriting Logic and Its Applications. WRLA 2016. Lecture Notes in Computer Science(), vol 9942. Springer, Cham. https://doi.org/10.1007/978-3-319-44802-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44802-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44801-5

  • Online ISBN: 978-3-319-44802-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation