Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,708,524 papers from all fields of science
Search
Sign In
Create Free Account
Matrix grammar
A matrix grammar is a formal grammar in which instead of single productions, productions are grouped together into finite sequences. A production…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Concatenation
Context-free grammar
Context-sensitive grammar
Controlled grammar
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Flat Splicing Array Grammar Systems GeneratingPicture Arrays
G. Samdanielthompson
,
N. David
,
A. Nagar
,
K. Subramanian
2016
Corpus ID: 39567400
While studying the recombinant behaviour of DNA molecules, Head (1987) introduced a new operation, called splicing on words or…
Expand
2016
2016
Regulated Contextual KP System
S. AjithaP
,
Dersanambika. K.S
2016
Corpus ID: 54536748
The basic Chomsky hierarchy of language families was obtained by imposing restrictions on the form of productions. Regulated…
Expand
2010
2010
Bulgarian Resource Grammar
P. Osenova
2010
Corpus ID: 182048560
2008
2008
Slender Siromoney matrix languages
Ralf Stiebe
Information and Computation
2008
Corpus ID: 29803208
2007
2007
Production planning by shuffle operation
Adalbert Golomety
,
A. Pitic
,
Iulia Golomety
,
A. Pitic
2007
Corpus ID: 62678839
This paper presents an implementation of shuffle operation in production planning. We present a computational formula for shuffle…
Expand
1994
1994
Learning Equal Matrix Grammars Based on Control Sets
Y. Takada
International journal of pattern recognition and…
1994
Corpus ID: 6965046
An equal matrix grammar is a parallel rewriting system. In this paper, we consider the problem of learning equal matrix grammars…
Expand
1991
1991
The Effective Entropies of Some Extensions of Context-Free Languages
D. Huynh
Information Processing Letters
1991
Corpus ID: 12106737
1984
1984
Six nonterminals are enough for generating each r.e. language by a matrix grammar
G. P. un
1984
Corpus ID: 115553653
It is proved that each recursively enumerable language can be generated by a context-free matrix grammar with appearance checking…
Expand
1972
1972
Unambiguous Equal Matrix Languages
R. Siromoney
Information and Control
1972
Corpus ID: 31647097
Highly Cited
1969
Highly Cited
1969
On Equal Matrix Languages
R. Siromoney
Information and Control
1969
Corpus ID: 11155263
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE