How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata (Q2915098)

From MaRDI portal
Revision as of 00:24, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata
scientific article

    Statements

    How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata (English)
    0 references
    0 references
    21 September 2012
    0 references

    Identifiers