We describe four complete and recursively enumerable formal systems S0; D0; H0; B0. Each one of them proves the decidability of some equivalence problem for some class of automata: namely the language equivalence problem for simple automata, the language equivalence problem for deterministic pushdow
On feedback equivalence and completion problems
β Scribed by Fernando C. Silva
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 508 KB
- Volume
- 265
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
In 1987, I. Zaballa characterized the possible similarity classes of a square matrix with some prescribed rows. In 1988, the same author characterized the possible feedback equivalence classes of [ A B ], where A is a fixed square matrix and B varies. Firstly, in this paper, we observe that these results are equivalent, that is, each one of them can be obtained as a corol]ary of the other. Then, we apply similar arguments to other inverse problems. In particular, we study the possible iuvariant polynomials and the possible characteristic pol)~omials of A + BX + YC, when X and Y vary, and we study the linear systems that can become completely observable with a suitable choice of linear state feedback control.
π SIMILAR VOLUMES
In this paper we look for a generalization of a property of matrix pairs, to quadruples of matrices. It is known that it is possible to analyze the feedback equivalence of matrix pairs in terms of the similarity of the square matrices belonging to sets related to the pairs. We will determine when it