This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...