18 search results - page 1 / 4 » Folk Theorems on the Determinization and Minimization of Tim... |
FORMATS
2003
Springer
13 years 10 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
HYBRID
1998
Springer
13 years 9 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
JCSS
2007
13 years 4 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
HYBRID
2009
Springer
13 years 11 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...