𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On behavior homomorphisms and system equivalence

✍ Scribed by P.A. Fuhrmann

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
119 KB
Volume
44
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we introduce the concept of a behavior homomorphisms and isomorphisms and use it to present a uniΓΏed approach to the study of equivalence of di erent behavior representations concentrating on a special representation we call normalized ARMA (NARMA) representation.

πŸ“œ SIMILAR VOLUMES

A note on continuous behavior homomorphi
A note on continuous behavior homomorphisms
✍ P.A. Fuhrmann πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 192 KB

The purpose of this note is the characterization of the class of behavior homomorphisms that have nice polynomial representations. The key to this is a judicious application of duality theory together with additional continuity requirements.

Behavior of Test Ideals under Smooth and
Behavior of Test Ideals under Smooth and Γ‰tale Homomorphisms
✍ A. Bravo; K.E. Smith πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 140 KB

We investigate the behavior of the test ideal of an excellent reduced ring of prime characteristic under base change. It is shown that if h A β†’ D is a smooth homomorphism, then Ο„ A D = Ο„ D , assuming that all residue fields of A at maximal ideals are perfect and that formation of the test ideal comm

On ?-equivalence and ?-equivalence of gr
On ?-equivalence and ?-equivalence of graphs
✍ Du, Qingyan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 336 KB πŸ‘ 1 views

W e define a partial ordering on the set of a-polynomials as well as a vertex splitting operation on the set of graphs, and introduce the notions of (r-equivalence and (r- uniqueness of graphs. Let a ( G ) be the a-polynomial of a graph G and a ( G ) = (r(GC). Let H = (G, u , A, 5) be a vertex spli