Advertisement

A General Framework for Sequential Grammars with Control Mechanisms

  • Rudolf FreundEmail author
Conference paper
  • 148 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11612)

Abstract

Since more than five decades, many control mechanisms have been introduced for sequential string grammars, including control graphs, matrices, permitting and forbidden contexts, and order relations. These control mechanisms then have been extended to sequential grammars working on objects different from strings, for example, to array, graph, and multiset grammars. Many relations between the languages generated by sequential grammars working on these objects with different control mechanisms were shown to be similar to the relations already proved for the string case. Within a general framework for regulated rewriting based on the applicability of rules in sequential grammars, many relations between various control mechanisms can be established in a very general setting without any reference to the underlying objects the rules are working on. Besides the well-known control mechanisms as control graphs, matrices, permitting and forbidden rules, partial order on rules, and priority relations on rules, the new variants of activation of rules as well as activation and blocking of rules are considered. Special results for strings and multisets as well as for arrays in the general variant defined on Cayley grids of finitely presented groups are exhibited based on the general results. Finally, some general results for cooperating distributed grammar systems are established.

Keywords

General framework Regulating rewriting Sequential grammars 

Notes

Acknowledgements

I am very grateful to my colleagues and co-authors for many fruitful discussions as well as for their contributions to the topics described in this overview paper: First parts for the concept of the general framework were already discussed and elaborated during my stay in Magdeburg with Jürgen Dassow nearly thirty years ago. Afterwards, partial results were used in several papers, for example, with Henning Fernau, Markus Holzer, and Gheorghe Păun. The first comprehensive collection of results in [13] then was elaborated with my colleagues in Vienna, Marion Oswald and Marian Kogler. Recent results, especially for sequential grammars with activation and blocking of rules (see [2, 3]), were elaborated together with Artiom Alhazov and Sergiu Ivanov.

References

  1. 1.
    Aizawa, K., Nakamura, A.: Grammars on the hexagonal array. In: Wang, P.S.P. (ed.) Array Grammars, Patterns and Recognizers, Series in Computer Science, vol. 18, pp. 144–152. World Scientific, Singapore (1989).  https://doi.org/10.1142/S0218001489000358
  2. 2.
    Alhazov, A., Freund, R., Ivanov, S.: P systems with activation and blocking of rules. In: Stepney, S., Verlan, S. (eds.) UCNC 2018. LNCS, vol. 10867, pp. 1–15. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-92435-9_1CrossRefzbMATHGoogle Scholar
  3. 3.
    Alhazov, A., Freund, R., Ivanov, S.: Sequential grammars with activation and blocking of rules. In: Durand-Lose and Verlan [8], pp. 51–68.  https://doi.org/10.1007/978-3-319-92402-1_3
  4. 4.
    Cavaliere, M., Freund, R., Oswald, M., Sburlan, D.: Multiset random context grammars, checkers, and transducers. Theor. Comput. Sci. 372(2–3), 136–151 (2007).  https://doi.org/10.1016/j.tcs.2006.11.022MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cook, C.R., Wang, P.S.P.: A Chomsky hierarchy of isotonic array grammars and languages. Comput. Graphics Image Process. 8, 144–152 (1978).  https://doi.org/10.1016/S0146-664X(78)80022-7CrossRefGoogle Scholar
  6. 6.
    Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, Gh,: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers (1994)Google Scholar
  7. 7.
    Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)Google Scholar
  8. 8.
    Durand-Lose, J., Verlan, S. (eds.): MCU 2018. LNCS, vol. 10881. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-92402-1CrossRefzbMATHGoogle Scholar
  9. 9.
    Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Comb. 12(1–2), 117–138 (2007).  https://doi.org/10.25596/jalc-2007-117MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Freund, R.: Control mechanisms on \(\#\)-context-free array grammars. In: Păun, Gh. (ed.) Mathematical Aspects of Natural and Formal Languages, pp. 97–137. World Scientific, Singapore (1994).  https://doi.org/10.1142/9789814447133_0006
  11. 11.
    Freund, R.: Control mechanisms for array grammars on Cayley grids. In: Durand-Lose and Verlan [8], pp. 1–33.  https://doi.org/10.1007/978-3-319-92402-1_1
  12. 12.
    Freund, R., Ivanov, S., Oswald, M., Subramanian, K.G.: One-dimensional array grammars and P systems with array insertion and deletion rules. In: Neary and Cook [20], pp. 62–75.  https://doi.org/10.4204/EPTCS.128
  13. 13.
    Freund, R., Kogler, M., Oswald, M.: A general framework for regulated rewriting based on the applicability of rules. In: Kelemen, J., Kelemenová, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 35–53. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-20000-7_5CrossRefGoogle Scholar
  14. 14.
    Freund, R., Oswald, M.: Array automata on Cayley grids. In: Neary and Cook [20], pp. 27–28.  https://doi.org/10.4204/EPTCS.128
  15. 15.
    Freund, R., Oswald, M.: Array grammars and automata on Cayley grids. J. Autom. Lang. Comb. 19(1–4), 67–80 (2014).  https://doi.org/10.25596/jalc-2014-067MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Holt, D.F., Eick, B., O’Brien, E.A.: Handbook of Computational Group Theory. CRC Press, Boca Raton (2005)CrossRefGoogle Scholar
  17. 17.
    Kudlek, M., Martín-Vide, C., Păun, Gh.: Toward a formal macroset theory. In: Calude, C.S., PĂun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2000. LNCS, vol. 2235, pp. 123–133. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45523-X_7
  18. 18.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)zbMATHGoogle Scholar
  19. 19.
    Mitrana, V.: On the generative capacity of hybrid CD grammar systems. Comput. Artif. Intell. 12(1), 231–244 (1993)MathSciNetGoogle Scholar
  20. 20.
    Neary, T., Cook, M. (eds.): MCU 2018. LNCS, vol. 128. Springer, Cham (2013).  https://doi.org/10.4204/EPTCS.128CrossRefGoogle Scholar
  21. 21.
    Păun, Gh.: Hybrid cooperating/distributed grammar systems. J. Inform. Process. Cybernet. EIK 30(4), 231–244 (1994)Google Scholar
  22. 22.
    Păun, Gh., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, New York (2010)Google Scholar
  23. 23.
    Rosenfeld, A.: Picture Languages. Academic Press, Reading (1979)zbMATHGoogle Scholar
  24. 24.
    Rosenfeld, A., Siromoney, R.: Picture languages - a survey. Lang. Des. 1(3), 229–245 (1993). http://dl.acm.org/citation.cfm?id=198440.198442Google Scholar
  25. 25.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, 3 volumes. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  26. 26.
    Salomaa, A.: Formal Languages. Academic Press, New York (1973)zbMATHGoogle Scholar
  27. 27.
    Wang, P.S.P.: An application of array grammars to clustering analysis for syntactic patterns. Pattern Recogn. 17, 441–451 (1984).  https://doi.org/10.1016/0031-3203(84)90073-6CrossRefzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2019

Authors and Affiliations

  1. 1.Faculty of InformaticsTU WienViennaAustria

Personalised recommendations