Reachability Games on Automatic Graphs (Q3073641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4804886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2851061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Model Checking using Widening Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent reachability games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank

Latest revision as of 18:56, 3 July 2024

scientific article
Language Label Description Also known as
English
Reachability Games on Automatic Graphs
scientific article

    Statements

    Identifiers

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