Solutions to four open problems concerning controlled pure grammar systems

References

• S. Aydin, H. Bordihn, Sequential versus parallel grammar formalisms with respect to measures of descriptional complexity, Fund. Inform. 55 (2003), pp. 243–254
   Web of Science ®Google Scholar
• S. Bensch, H. Bordihn, Active symbols in pure systems, Fund. Inform. 76 (2007), pp. 239–254
   Web of Science ®Google Scholar
• H. Bordihn, E. Csuhaj-Varjú, J. Dassow, CD Grammar systems versus L systems, Grammatical Models of Multi-Agent Systems, Topics in Computer Mathematics, Vol. 8, G. Pǎun, A. Salomaa, eds., Gordon and Breach Science Publishers, Amsterdam, 1999, pp. 18–32
   Google Scholar
• H. Bordihn, M. Holzer, M. Kutrib, Determination of finite automata accepting subregular languages, Theor. Comput. Sci. 410 (2009), pp. 3209–3222 doi: 10.1016/j.tcs.2009.05.019
   Web of Science ®Google Scholar
• E. Csuhaj-Varjú, J. Dassow, J. Kelemen, G. Păun, Grammar Systems: A Grammatical Approach to Distribution and Cooperation, 1994 Gordon and Breach, Yverdon
   Google Scholar
• J. Dassow, H. Fernau, G. Păun, On the leftmost derivation in matrix grammars, Int. J. Found. Comput. Sci. 10 (1999), pp. 61–80
   Google Scholar
• J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory, Springer, New York, 1989
   Google Scholar
• J. Dassow and B. Truthe, Subregularly tree controlled grammars and languages, in Automata and Formal Languages, E. Csuhaj-Varjú and Z. ésik, eds., Computer and Automation Research Institute, Hungarian Academy of Sciences, Balatonfured, 2008, pp. 158–169.
   Google Scholar
• H. Fernau, Regulated grammars under leftmost derivation, Grammars 3 (2000), pp. 37–62 doi: 10.1023/A:1009954606346
   Google Scholar
• D. Gales, Modern Compiler Design, Addison-Wesley, Boston, MA, 2004
   Google Scholar
• E. Mäkinen, A note on pure grammars, Inform. Process. Lett. 23 (1986), pp. 271–274 doi: 10.1016/0020-0190(86)90085-2
   Web of Science ®Google Scholar
• P. Martinek, Limits of pure grammars with monotone productions, Fund. Inform. 33 (1998), pp. 265–280
   Google Scholar
• C. Martín-Vide, V. Mitrana, G. Păun, eds., Formal Languages and Applications, Chapter 13, Springer, Berlin, 2004, pp. 249–274
   Google Scholar
• T. Masopust, J. Techet, Leftmost derivations of propagating scattered context grammars: A new proof, Discrete Math. Theor. Comput. Sci. 10 (2008), pp. 39–46
   Web of Science ®Google Scholar
• H. A. Maurer, A. Salomaa, D. Wood, Pure grammars, Inf. Control 44 (1980), pp. 47–72 doi: 10.1016/S0019-9958(80)90131-X
   Google Scholar
• A. Meduna, On the number of nonterminals in matrix grammars with leftmost derivations, New Trends in Formal Languages – Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday), G. Pǎun, A. Salomaa, eds., Springer, London, UK, 1997, pp. 27–38
   Google Scholar
• A. Meduna, Automata and Languages: Theory and Applications, Springer, London, 2000
   Google Scholar
• A. Meduna, Elements of Compiler Design, Auerbach Publications, Boston, MA, 2007
   Google Scholar
• A. Meduna and F. Goldefus, Weak leftmost derivations in cooperative distributed grammar systems, MEMICS’09: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Brno University of Technology, Brno, CZ, 2009, pp. 144–151.
   Google Scholar
• A. Meduna, P. Zemek, Controlled pure grammar systems, J. Universal Comput. Sci. 18 (2012), pp. 2024–2040
   Web of Science ®Google Scholar
• A. Meduna and P. Zemek, One-Sided Random Context Grammars with Leftmost Derivations, LNCS Festschrift Series: Languages Alive, Vol. 7300, Springer, New York, 2012, pp. 160–173.
   Google Scholar
• M. Mutyam, K. Krithivasan, Tissue P systems with leftmost derivation, Ramanujan Math. Soc. Lecture Notes Ser. 3 (2007), pp. 187–196
   Google Scholar
• B. Nagy, Union-free regular languages and 1-cycle-free-path automata, Publ. Math. Debrecen. 98 (2006), pp. 183–197
   Google Scholar
• S. Pande, D. Agrawal (eds.), Compiler Optimizations for Scalable Parallel Systems: Languages, Compilation Techniques, and Run Time SystemsS. Pande, D. Agrawal, Springer, New York, 2001
   Google Scholar
• G. Păun, On leftmost derivation restriction in regulated rewriting, Romanian J. Pure Appl. Math. 30 (1985), pp. 751–758
   Google Scholar
• G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1: Word, Language, Grammar, Springer, New York, 1997
   Google Scholar
• G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 2: Linear Modeling: Background and Application, Chapter 3, Springer, New York, 1997, pp. 101–154
   Google Scholar
• M. Wolfe, High-Performance Compilers for Parallel Computing, Addison-Wesley, Boston, MA, 1995
   Google Scholar