Pages that link to "Item:Q1948277"
From MaRDI portal
The following pages link to Automata for the verification of monadic second-order graph properties (Q1948277):
Displaying 17 items.
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Second-order finite automata: expressive power and simple proofs using automatic structures (Q832943) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Model-Checking by Infinite Fly-Automata (Q2850017) (← links)
- Special tree-width and the verification of monadic second-order graph properties (Q2908834) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- (Q5013878) (← links)
- Fly-Automata, Their Properties and Applications (Q5200070) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)