Regulated Grammars and Computation
In practice, computation is almost always regulated by some additional conditions and restrictions placed upon the way it is performed under given circumstances. To investigate computation regulated in this way as precisely as possible, language theory has formalized it by a variety of regulated grammars. In essence, all these grammars are based upon some restrictions placed upon their derivations and, thereby, properly express computational regulation. This chapter covers major types of these grammars.
- [Mas06]T. Masopust, An improvement of the descriptional complexity of grammars regulated by context conditions, in 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Faculty of Information Technology BUT, Brno, CZ, 2006), pp. 105–112Google Scholar
- [MVMP04]C. Martín-Vide, V. Mitrana, G. Păun (eds.), Formal Languages and Applications, chapter 13 (Springer, Berlin, 2004), pp. 249–274Google Scholar
- [RS97b]G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 2: Linear Modeling: Background and Application (Springer, New York, 1997)Google Scholar
- [Zet10]G. Zetzsche, On erasing productions in random context grammars, in ICALP’10: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (Springer, 2010), pp. 175–186Google Scholar