Pages that link to "Item:Q4713368"
From MaRDI portal
The following pages link to On constructing obstruction sets of words (Q4713368):
Displaying 14 items.
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Derivation Tree Analysis for Accelerated Fixed-Point Computation (Q3533020) (← links)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (Q3617755) (← links)
- A note on the computability of graph minor obstruction sets for monadic second order ideals (Q4520519) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
- (Q5111264) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
