Pages that link to "Item:Q1164998"
From MaRDI portal
The following pages link to Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (Q1164998):
Displaying 10 items.
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- Tree-like parse and polynomial subclasses of search problems (Q1082828) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
