Abstract
In this paper we will fix the position of Minimalist Grammars as defined in Stabler (1997) in the hierarchy of formal languages. Michaelis (1998) has shown that the set of languages generated by Minimalist Grammars is a subset of the set of languages generated by Multiple Context-Free Grammars (Seki et al., 1991). In this paper we will present a proof showing the reverse. We thus conclude that Minimalist Grammars are weakly equivalent to Multiple Context-Free Grammars.
Cite
CITATION STYLE
Harkema, H. (2001). A characterization of minimalist languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2099, pp. 193–211). Springer Verlag. https://doi.org/10.1007/3-540-48199-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
