Nested antichains for WS1S (Q1733101): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VATA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Antichains / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Slide / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MTBDD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MONA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2907969637 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.03849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Antichains for WS1S / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable logics combining heap structures and data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree Width of Separation Logic with Recursive Definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated verification of shape, size and bag properties via user-defined predicates in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Array theory of bounded elements and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Decision Procedure for Imperative Tree Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain Algorithms for Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Simulation Meets Antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Simulations over Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forest automata for verification of heap manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: MONA IMPLEMENTATION SECRETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of symbolic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5351976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5517677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata / rank
 
Normal rank

Latest revision as of 19:50, 18 July 2024

scientific article
Language Label Description Also known as
English
Nested antichains for WS1S
scientific article

    Statements

    Nested antichains for WS1S (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references