Pages that link to "Item:Q714852"
From MaRDI portal
The following pages link to Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852):
Displaying 4 items.
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
