An Approach to Computing Downward Closures (Q3449495): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1646789098 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.01068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using forward reachability analysis for verification of lossy channel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexed Grammars—An Extension of Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Vector Addition Systems with one zero-test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Cost Functions, Part I: Logic and Algebra over Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4713368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between ETOL and EDTOL languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shrinking lemma for indexed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of Higman-Haines sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Downward-Closure of Petri Net Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free monoids partially ordered by embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On derivation trees of indexed grammars - an extension of the uvwxy- theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective constructions in well-partially-ordered free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems in unreliable computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Infinite Words Determined by Indexed Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Computing Downward Closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Downward Closures for Stacked Counter Automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:11, 11 July 2024

scientific article
Language Label Description Also known as
English
An Approach to Computing Downward Closures
scientific article

    Statements

    An Approach to Computing Downward Closures (English)
    0 references
    0 references
    4 November 2015
    0 references

    Identifiers