Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852)
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: Parsing Boolean grammars over a one-letter alphabet using online convolution
scientific article; zbMATH DE number 6093059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parsing Boolean grammars over a one-letter alphabet using online convolution |
scientific article; zbMATH DE number 6093059 |
Statements
Parsing Boolean grammars over a one-letter alphabet using online convolution (English)
0 references
11 October 2012
0 references
Boolean grammars
0 references
conjunctive grammars
0 references
context-free grammars
0 references
unary languages
0 references
parsing
0 references
Boolean convolution
0 references
integer multiplication
0 references
0.8393558263778687
0 references
0.8248084783554077
0 references
0.7878429889678955
0 references
0.7809431552886963
0 references
