Topic
Matrix grammar
About: Matrix grammar is a research topic. Over the lifetime, 40 publications have been published within this topic receiving 2611 citations.
Papers
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
2,470 citations
TL;DR: It is proved that the P systems with context-free rules are computationally universal, able to generate all computable array languages.
Abstract: We consider array languages (sets of pictures consisting of symbols placed in the lattice points of the 2D grid) and the possibility to handle them with P systems. After proving binary normal forms for array matrix grammars (which, even in the case when no appearance checking is used, are known to generate the array languages of arbitrary array grammars), we prove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able to generate all computable array languages. Some open problems are also formulated.
91 citations
TL;DR: LinGO Grammar Matrix as mentioned in this paper is a web-based service which elicits typological descriptions of languages and outputs customized grammar fragments which are ready for sustained development into broad-coverage grammars.
Abstract: This paper presents the LinGO Grammar Matrix grammar customization system, a web-based service which elicits typological descriptions of languages and outputs customized grammar fragments which are ready for sustained development into broad-coverage grammars. We describe the infrastructure we have developed to support grammar customization as well as the current set of linguistic phenomena addressed, reflect on what we have learned about a methodology for this style of multilingual grammar engineering, and evaluate the typological breadth of the system by using it to create grammars for seven languages from seven different language families.
70 citations
TL;DR: It is proved that recursively enumerable languages can be generated by matrix grammars with only two non-terminal symbols being used in the appearance checking mode, and three classes of membrane systems are considered, and in all the three cases the hierarchies are shown to collapse at level four.
38 citations
[...]
TL;DR: Several new types of grammars are introduced; some of them are proved to possess the same generative power as ordinary matrix Grammars; for some other types inclusion properties are obtained.
Abstract: The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weakening the matrix restrictions imposed on context-free grammars several new types of grammars are introduced; some of them are proved to possess the same generative power as ordinary matrix grammars; for some other types inclusion properties are obtained.
30 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2020 | 3 |
| 2019 | 1 |
| 2018 | 3 |
| 2017 | 1 |
| 2016 | 1 |