Finite automata on timed \(\omega\)-trees
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.
scientific article; zbMATH DE number 1944742