English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Morphisms are homomorphisms under the concatenation operation of the set ofwords over a finite set. Changing the elements of the finite set does notessentially change the morphism. We propose a way to select a uniquerepresenting member out of all these morphisms. This has applications to theclassification of the shift dynamical systems generated by morphisms. In asimilar way, we propose the selection of a representing sequence out of theclass of symbolic sequences over an alphabet of fixed cardinality. Both methodsare useful for the storing of symbolic sequences in databases, like The On-LineEncyclopedia of Integer Sequences. We illustrate our proposals with the$k$-symbol Fibonacci sequences.

Morphisms, Symbolic sequences, and their Standard Forms