Pages that link to "Item:Q2799199"
From MaRDI portal
The following pages link to Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199):
Displaying 8 items.
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← 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)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
- (Q5111264) (← links)
- (Q5376657) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
