Abstract. We investigate the density of critical factorizations of infinte sequences of words. The density of critical factorizations of a word is the ratio between the number of p...
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
Jakub Neumann, Andrzej Szepietowski, Igor Walukiew...
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
In this paper we present a GB-parsing system for German and in particular the system's strategy for argument interpretation, which copes with the difficulty that word order i...
Christopher Laenzlinger, Martin S. Ulmann, Eric We...
: The input-to-state stability (ISS) problem is studied for switched systems with infinite subsystems. By the method of multiple Lyapunov function, a sufficient ISS condition is gi...