Parallel Grammars and Computation

  • Alexander Meduna
  • Ondřej Soukup


Originally, computer programs were always executed strictly sequentially. Indeed, to perform a computational task, an algorithm was written and implemented as an instruction sequence executed on a central processing unit on a single computer. Only one instruction was executed at a time, so after this instruction was completed, the next instruction was executed until all the sequence of instructions was performed in this one-by-one way. In the mid-1980s or so, however, computer programmers introduced the first pioneer programs that performed several parts of a single computational task simultaneously. At that time, parallel computation emerged in computer science.


  1. [BCVHV05]
    M. Beek, E. Csuhaj-Varjú, M. Holzer, G. Vaszil, On competence in CD grammar systems, in Developments in Language Theory, vol. 3340 of Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2005), pp. 3–14Google Scholar
  2. [BCVHV07]
    M. Beek, E. Csuhaj-Varjú, M. Holzer, G. Vaszil, On competence in CD grammar systems with parallel rewriting. Int. J. Found. Comput. Sci. 18(6), 1425–1439 (2007)MathSciNetCrossRefMATHGoogle Scholar
  3. [BH00]
    H. Bordihn, M. Holzer, Grammar systems with negated conditions in their cooperation protocols. J. Universal Comput. Sci. 6(12), 1165–1184 (2000)MathSciNetMATHGoogle Scholar
  4. [BH08]
    H. Bordihn, M. Holzer, Random context in regulated rewriting versus cooperating distributed grammar systems, in LATA’08: Proceedings of the 2nd International Conference on Language and Automata Theory and Applications (Springer, 2008), pp. 125–136Google Scholar
  5. [CVDV08]
    E. Csuhaj-Varjú, J. Dassow, G. Vaszil, Some new modes of competence-based derivations in CD grammar systems, in Developments in Language Theory, vol. 5257 of Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2008), pp. 228–239Google Scholar
  6. [CVPS95]
    E. Csuhaj-Varjú, G. Păun, A. Salomaa, Conditional tabled eco-grammar systems. J. Universal Comput. Sci. 1(5), 252–268 (1995)MATHGoogle Scholar
  7. [CVV10]
    E. Csuhaj-Varjú, G. Vaszil, Scattered context grammars generate any recursively enumerable language with two nonterminals. Inf. Process. Lett. 110, 902–907 (2010)MathSciNetCrossRefMATHGoogle Scholar
  8. [Das07]
    J. Dassow, On cooperating distributed grammar systems with competence based start and stop conditions. Fundamenta Informaticae 76, 293–304 (2007)MathSciNetMATHGoogle Scholar
  9. [DP89]
    J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)CrossRefMATHGoogle Scholar
  10. [FHF01]
    H. Fernau, M. Holzer, R. Freund, Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1–2), 405–426 (2001)MathSciNetCrossRefMATHGoogle Scholar
  11. [Mas07a]
    T. Masopust, Formal models: regulation and reduction, PhD thesis, Faculty of Information Technology, Brno University of Technology, 2007Google Scholar
  12. [Mas07b]
    T. Masopust, Scattered context grammars can generate the powers of 2, in Proceedings of the 13th Conference and Competition EEICT 2007, vol. 4 (Faculty of Electrical Engineering and Communication, Brno University of Technology, 2007), pp. 401–404Google Scholar
  13. [Med00c]
    A. Meduna, Terminating left-hand sides of scattered context grammars. Theor. Comput. Sci. 2000(237), 424–427 (2000)MathSciNetMATHGoogle Scholar
  14. [MT10]
    A. Meduna, J. Techet, Scattered Context Grammars and Their Applications (WIT Press, Southampton, 2010)MATHGoogle Scholar
  15. [RS78]
    G. Rozenberg, S.H. Solms, Priorities on context conditions in rewriting systems. Inf. Sci. 14(1), 15–50 (1978)MathSciNetCrossRefMATHGoogle Scholar
  16. [RS97a]
    G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1: Word, Language, Grammar (Springer, New York, 1997)Google Scholar
  17. [Sal73]
    A. Salomaa, Formal Languages (Academic Press, London, 1973)MATHGoogle Scholar
  18. [Sol76]
    S.H. Solms, Some notes on ET0L languages. Int. J. Comput. Math. 5, 285–296 (1976)MathSciNetCrossRefMATHGoogle Scholar
  19. [Sos03]
    P. Sosík, The power of catalysts and priorities in membrane systems. Grammars 6(1), 13–24 (2003)MathSciNetCrossRefMATHGoogle Scholar
  20. [Vas05]
    G. Vaszil, On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theor. Comput. Sci. 330(2), 361–373 (2005)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Alexander Meduna
    • 1
  • Ondřej Soukup
    • 2
  1. 1.Department of Computer ScienceBrno University of TechnologyBrnoCzech Republic
  2. 2.Department of Information TechnologyBrno University of TechnologyBrnoCzech Republic

Personalised recommendations