644 search results - page 29 / 129 » Precedence Automata and Languages |
95
Voted
AMW
2010
15 years 2 months ago
2010
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
97
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
95
Voted
FSEN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
156
Voted
CAV
1994
Springer
15 years 5 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...