The following pages link to (Q4205068):
Displaying 11 items.
- Isomorphisms and algorithmic properties of structures with two equivalences (Q321265) (← links)
- A structural/temporal query language for business processes (Q414923) (← links)
- On the regular structure of prefix rewriting (Q685354) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic (Q4333462) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)