A note on the equivalence and complexity of linear grammars (Q1430207)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the equivalence and complexity of linear grammars |
scientific article; zbMATH DE number 2069171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the equivalence and complexity of linear grammars |
scientific article; zbMATH DE number 2069171 |
Statements
A note on the equivalence and complexity of linear grammars (English)
0 references
27 May 2004
0 references
formal languages
0 references
linear grammars
0 references
equivalence properties
0 references
reversal complexity
0 references
Kolmogorov complexity
0 references
0.9135225
0 references
0.91224223
0 references
0 references
0.9081295
0 references
0.9035741
0 references
0.8985373
0 references
