Pages that link to "Item:Q639852"
From MaRDI portal
The following pages link to One-nonterminal conjunctive grammars over a unary alphabet (Q639852):
Displaying 8 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Representing hyper-arithmetical sets by equations over sets of integers (Q693054) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Language equations (Q2074222) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)