On context-free rewriting with a simple restriction and its computational completeness (Q3625698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5551442
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On context-free rewriting with a simple restriction and its computational completeness |
scientific article; zbMATH DE number 5551442 |
Statements
On context-free rewriting with a simple restriction and its computational completeness (English)
0 references
6 May 2009
0 references
formal languages
0 references
context-free grammar
0 references
context-free rewriting system
0 references
derivation restriction
0 references
generative power
0 references
0.89734435
0 references
0.8845261
0 references
0.8803029
0 references
0.8748998
0 references
0.87391543
0 references
0.8699428
0 references
0 references
0 references
0 references
