scientific article; zbMATH DE number 7799616

DOI10.4230/LIPICS.FSTTCS.2021.38arXiv2110.14238MaRDI QIDQ6187054

Karoliina Lehtinen, Udi Boker

Publication date: 5 February 2024

Full work available at URL: https://arxiv.org/abs/2110.14238

Title of this publication is not available (Why is that?)

zbMATH Keywords

alternationquantitative automatagood for gameshistory determinism

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (5)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism ⋮ History-deterministic timed automata ⋮ Checking history-determinism is NP-hard for parity automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187054)