Similar Items: Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
- Deterministic Suffix-reading Automata
- An automata-based approach for synchronizable mailbox communication
- Tighter Bounds for Query Answering with Guarded TGDs
- Refined Risk Bounds for Unbounded Losses via Transductive Priors
- Univalent Enriched Categories and the Enriched Rezk Completion
- Positionality in $Σ_0^2$ and a completeness result