Pages that link to "Item:Q909481"
From MaRDI portal
The following pages link to Results of NLC grammars with one-letter terminal alphabets (Q909481):
Displaying 10 items.
- Restrictions on NLC graph grammars (Q1059402) (← links)
- Handle NLC grammars and r. e. languages (Q1092670) (← links)
- Nonterminal bounded NLC graph grammars (Q1114416) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Node replacement graph languages squeezed with chains, trees, and forests (Q1891164) (← links)
- On the inference of non-confluent NLC graph grammars (Q2843997) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- (Q3993679) (← links)