Abstract
Sewing grammars are very simple grammars, still able to define families of mildly context-sensitive languages. These grammars are inspired from Marcus contextual grammars and simple matrix grammars.We consider various families of sewing grammars. Some of them lead to very special families of languages such that each such family is a mildly context-sensitive family of languages, and, moreover, most of the fundamental problems, like the equivalence problem, the inclusion problem, etc., are decidable.
Cite
CITATION STYLE
Martin-Vide, C., & Mateescu, A. (1999). Sewing grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1684, pp. 398–408). Springer Verlag. https://doi.org/10.1007/3-540-48321-7_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
