The following pages link to (Q3219131):
Displaying 7 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting (Q4645289) (← links)
