The following pages link to (Q4205068):
Displaying 6 items.
- A structural/temporal query language for business processes (Q414923) (← links)
- On the regular structure of prefix rewriting (Q685354) (← 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)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
