Pages that link to "Item:Q807611"

The following pages link to The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611):

Displaying 11 items.

• Querying probabilistic business processes for sub-flows (Q359875) (← links)
• Automorphism groups of context-free graphs (Q671518) (← links)
• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
• Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
• Deciding the isomorphism problem in classes of unary automatic structures (Q2430013) (← links)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)