Pages that link to "Item:Q4286529"
From MaRDI portal
The following pages link to Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529):
Displayed 5 items.
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- A confluent reduction for the λ-calculus with surjective pairing and terminal object (Q4895554) (← links)