Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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: W2582132278 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.05160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2920108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of nondeterministic tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Procedural Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Minimization of Deterministic $$\omega $$ -Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimming Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Variants of Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Büchi Automata Can Have Smaller Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of symbolic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising Deterministic Büchi Automata Precisely Using SAT Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving the Partial MAX-SAT Problem / 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: Nested interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimized automaton representation of reachable states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MONA IMPLEMENTATION SECRETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization, Learning, and Conformance Testing of Boolean Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced automata minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Language Equivalence on Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Evaluation of Classical Automata Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Transducers for Approximate Validation of Streaming XML / rank
 
Normal rank

Latest revision as of 05:18, 23 July 2024

scientific article
Language Label Description Also known as
English
Minimization of Visibly Pushdown Automata Using Partial Max-SAT
scientific article

    Statements

    Minimization of Visibly Pushdown Automata Using Partial Max-SAT (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2020
    0 references

    Identifiers