An abstract is not available for this content so a preview has been provided. As you have access to content, full PDF via the ‘Save PDF’ action button.

An abstract is not available for this content so a preview has been provided. As you have access to content, full PDF via the ‘Save PDF’ action button.

An abstract is not available for this content so a preview has been provided. As you have access to content, full PDF via the ‘Save PDF’ action button.

An abstract is not available for this content so a preview has been provided. As you have access to content, full PDF via the ‘Save PDF’ action button.

A generalised relational data model is formalised for the representation of data with nested structure of arbitrary depth. A recursive algebra for the proposed model is presented. All the operations are formally defined. The proposed model is proved to be a superset of the conventional relational model (CRM). The functionality and validity of the model is shown by a prototype implementation tha...

We describe a class of C∗-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space C∗-algebras of Matsumoto. In doing so we shed some new light on the different C∗-algebras that may be associated to a shift space. Finally, we show how to associate a simple C∗-algebra to an irreducible sofic shift. keywords: C∗-algebras, labelled graph, ultragraph, Matsumo...

The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie algebra, starting from the nonzero brackets in its law. More concretely, an algorithm is described and implemented to compute a basis for each nontrivial abelian subalgebra with the help of the symbolic computation package MAPLE. Finally, it is also shown a brief computational study for this impl...