Directed regular and context-free languages
From MaRDI portal
Cites work
- A taxonomy of problems with fast parallel algorithms
- A very hard log-space counting class
- Algorithmics on SLP-compressed strings: a survey
- An approach to computing downward closures
- Checking refinement of asynchronous programs against context-free specifications
- Context-bounded analysis for concurrent programs with dynamic creation of threads
- Context-bounded analysis of concurrent programs (invited talk)
- Cost automata, safe schemes, and downward closures
- Deciding atomicity of subword-closed languages
- Deciding piecewise testable separability for regular tree languages
- Demystifying Reachability in Vector Addition Systems
- Directed regular and context-free languages
- Effective constructions in well-partially-ordered free monoids
- Existential definability over the subword ordering
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Forward Analysis for WSTS, Part II: Complete WSTS
- Forward analysis for WSTS. I: Completions
- Forward analysis for WSTS. III: Karp-Miller trees
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- Handling infinitely branching well-structured transition systems
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 10087 (Why is no real title available?)
- scientific article; zbMATH DE number 6790161 (Why is no real title available?)
- scientific article; zbMATH DE number 3252233 (Why is no real title available?)
- Ideal decompositions for vector addition systems (invited talk)
- Leaf languages and string compression
- On free monoids partially ordered by embedding
- Polynomial-time word problems.
- PP is as Hard as the Polynomial-Time Hierarchy
- Regular separability of well-structured transition systems
- Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
- Separability by piecewise testable languages and downward closures beyond subwords
- The complexity of bounded context switching with dynamic thread creation
- The complexity of downward closure comparisons
- The complexity of regular abstractions of one-counter languages
- The diagonal problem for higher-order recursion schemes is decidable
- The downward-closure of Petri net languages
- The ideal view on Rackoff's coverability technique
- Unboundedness and downward closures of higher-order pushdown automata
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Universal Horn Sentences and the Joint Embedding Property
- Using forward reachability analysis for verification of lossy channel systems
This page was built for publication: Directed regular and context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902686)
