Pages that link to "Item:Q1812942"
From MaRDI portal
The following pages link to A comparison of compatible, finite, and inductive graph properties (Q1812942):
Displaying 5 items.
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- Process specification and verification (Q4645279) (← links)
- Decision problems for edge grammars (Q5096886) (← links)
