Finite automata on timed \(\omega\)-trees (Q1395427)

From MaRDI portal
Revision as of 18:12, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finite automata on timed \(\omega\)-trees
scientific article

    Statements

    Finite automata on timed \(\omega\)-trees (English)
    0 references
    0 references
    0 references
    1 July 2003
    0 references
    A theory of timed \(\omega\)-trees which extends both the theory of timed \(\omega\)-sequences and the theory of \(\omega\)-trees is presented. The main problems discussed in this paper are the complexity of decision problems and their applications to system verification and analysis.
    0 references
    0 references
    \(\omega\)-trees
    0 references
    timed \(\omega\)-trees
    0 references