Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Undecidable Problems About Timed Automata   We solve some decision problems for timed automata which were recently raised
by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of
Timed Automata, in the Proceedings of the International Workshop FORMATS'2003,
LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed
Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume
83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a
given timed automaton is determinizable or whether the complement of a timed
regular language is timed regular. We show that the problem of the minimization
of the number of clocks of a timed automaton is undecidable. It is also
undecidable whether the shuffle of two timed regular languages is timed
regular. We show that in the case of timed B\"uchi automata accepting infinite
timed words some of these problems are Pi^1_1-hard, hence highly undecidable
(located beyond the arithmetical hierarchy).

15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
27
The categories of this paper are: comp-gas
11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph
16
The categories of this paper are: stat
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
32
The categories of this paper are: atom-ph
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph