Pages that link to "Item:Q5964015"
From MaRDI portal
The following pages link to Computations by fly-automata beyond monadic second-order logic (Q5964015):
Displaying 15 items.
- 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)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- On defining linear orders by automata (Q2211260) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Model-Checking by Infinite Fly-Automata (Q2850017) (← links)
- Fly-Automata, Their Properties and Applications (Q5200070) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)