zbMATH — the first resource for mathematics

Kleene theorems for event-clock automata. (English) Zbl 0948.68106
Ciobanu, Gabriel (ed.) et al., Fundamentals of computation theory. 12th international symposium, FCT ’99. Iaşi, Romania, August 30 - September 3, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1684, 215-225 (1999).
Summary: We define some class of regular expressions equivalent to event-clock automata. It is shown that regular expressions cannot be given a compositional semantics in terms of timed state sequences. We introduce a modified version of timed state sequences supporting a partial operation of concatenation on which we may build the semantics of regular expressions. A forgetting map then induces a semantics in terms of the classic version of timed state sequences. We also define several types of languages of automata in terms of classic or modified timed state sequences. Two Kleene theorems, one for each type of timed state sequences, relating expressions and event-clock automata are proved.
For the entire collection see [Zbl 0921.00033].

68Q45 Formal languages and automata