scientific article; zbMATH DE number 10087
From MaRDI portal
Publication:4713368
Recommendations
Cited in
(20)- The obstructions of a minor-closed set of graphs defined by a context-free grammar
- On computing graph minor obstruction sets
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- An approach to computing downward closures
- Derivation Tree Analysis for Accelerated Fixed-Point Computation
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- scientific article; zbMATH DE number 475617 (Why is no real title available?)
- scientific article; zbMATH DE number 1543064 (Why is no real title available?)
- Finite automata as characterizations of minor closed tree families (extended abstract)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- Derivation tree analysis for accelerated fixed-point computation
- Cost Automata, Safe Schemes, and Downward Closures
- Cost automata, safe schemes, and downward closures
- Directed regular and context-free languages
- Priority downward closures
- Verifying unboundedness via amalgamation
- On the state complexity of closures and interiors of regular languages with subwords and superwords
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713368)
