Stability Theory of Switched Dynamical Systems | SpringerLink Skip to main content
Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart Book cover …

Efficient algorithms for deciding the type of growth of products of integer matrices Page 1
Linear Algebra and its Applications 428 (2008) 2296–2311 www.elsevier.com/locate/laa …

In this note, we present criteria for marginal stability and marginal instability of switched
systems. For switched nonlinear systems, we prove that uniform stability is equivalent to the …

Stability properties for continuous-time linear switched systems are at first determined by the
(largest) Lyapunov exponent associated with the system, which is the analogue of the joint …

We give an O (n+ t) time algorithm to determine whether an NFA with n states and t
transitions accepts a language of polynomial or exponential growth. Given an NFA …

In this article, we formalize the concept of tracking in a sensor network and develop a
quantitative theory of trackability of weak models that investigates the rate of growth of the …

Transducers are finite-state machines which compute functions (or relations) from words to
words. They can be seen as simple programs with limited memory which manipulate strings …

This paper studies a robust class of functions from finite words to integers that we call ℤ-
polyregular functions. We show that it admits natural characterizations in terms of logics, ℤ …

Of course, the papers mentioned below mainly reflect my personal interests. I may miss
some papers that other people consider “very important”, or I may not know some of them …

We give an O (n+ t) time algorithm to determine whether an NFA with n states and t
transitions accepts a language of polynomial or exponential growth. Given a NFA accepting …