Pages that link to "Item:Q5286167"
From MaRDI portal
The following pages link to Efficient decision procedures for graph properties on context-free graph languages (Q5286167):
Displaying 6 items.
- A structural/temporal query language for business processes (Q414923) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Decision problems for edge grammars (Q5096886) (← links)