Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Social media language contains huge amount and wide variety of nonstandard tokens, created both intentionally and unintentionally by the users. It is of crucial importance to norm...
We obtain explicit formulas for normalized doubly coprime factorizations of the transfer functions of the following class of linear systems: the input and output operators are vec...
Abstract— This paper presents a new algorithm for realization of Gramian-preserving frequency transformation for linear discrete-time systems. In the proposed algorithm, we const...