Pages that link to "Item:Q1129012"
From MaRDI portal
The following pages link to Power properties of NLC graph grammars with a polynomial membership problem (Q1129012):
Displaying 4 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
