Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. It has been recently noticed that in the situation when the parser is to explore sev...
In this paper we study the complexity of the reachability problem Hornets, an algebraic extension of object nets. Here we consider the restricted class of safe, elementary Hornets....
Robustness of timed systems aims at studying whether infinitesimal perturbations in clock values can result in new discrete behaviors. A model is robust if the set of discrete beh...
We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which all...
In this paper we explore the possibility of introducing the equality symbol in the languages of Fuzzy Description Logics (FDLs) interpreted as a similarity relation. In the talk w...