Reachability in Succinct and Parametric One-Counter Automata (Q3184686): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4251918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric real-time reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs with Lists Are Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flat Parametric Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effects of Bounding Syntactic Resources on Presburger LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way FA with monotonic counters and quadratic Diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solvability of a class of Diophantine equations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP lower bounds for equivalence-checking and model-checking of one-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diophantine Problem for Addition and Divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449211 / rank
 
Normal rank

Latest revision as of 01:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Reachability in Succinct and Parametric One-Counter Automata
scientific article

    Statements

    Identifiers