Advertisement

Maximally Parallel Contextual String Rewriting

  • Traian Florin Şerbănuţă
  • Liviu P. Dinu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Membrane Computing Parallel Derivation Contextual Grammar Rule Instance Deletion Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

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.

References

  1. 1.
    Bottoni, P., Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane systems with promoters/inhibitors. Acta Inform. 38(10), 695–720 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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 MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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-5CrossRefGoogle Scholar
  4. 4.
    Dinu, L.P.: On insertion grammars with maximum parallel derivation. Fundam. Inf. 93(4), 357–369 (2009)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Galiukschov, B.S.: Semicontextual grammars. In: Matematika Logica i Matematika Linguistika, pp. 38–50. Tallin University (1981)Google Scholar
  6. 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)CrossRefGoogle Scholar
  7. 7.
    Kari, L., Thierrin, G.: Contextual insertions, deletions, computability. Inf. Comput. 131(1), 47–61 (1996). ISSN 0890-5401MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Levelt, W.J.M., Indefrey, P.: The speaking mind/brain: where do spoken words come from, pp. 77–93 (2000)Google Scholar
  9. 9.
    Lindenmayer, A., Rozenberg, G. (eds.): Automata, Languages, Development. North-Holland Publishing Co., Amsterdam (1976)zbMATHGoogle Scholar
  10. 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. 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. 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-7CrossRefGoogle Scholar
  13. 13.
    Mitchell, T.M.: Machine Learning, vol. 45, p. 995. McGraw Hill, Burr Ridge (1997)zbMATHGoogle Scholar
  14. 14.
    Păun, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer Science & Business Media, New York (2012)zbMATHGoogle Scholar
  16. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 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

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer ScienceUniversity of BucharestBucharestRomania

Personalised recommendations