  The paper studies the problem of minimality and identifiability for Switched
Auto-Regressive eXogenous (abbreviated by SARX) systems. We propose formal
definitions of the concepts of identifiability and minimality for SARX models.
Based on these formalizations, we derive conditions for minimality and
identifiability of SARX systems. In particular, we show that polynomially
parametrized SARX systems are generically identifiable.
