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

Automatic sequences have many properties that other sequences (in particular,non-uniformly morphic sequences) do not necessarily share. In this paper wesurvey a number of different methods that can be used to prove that a givensequence is not automatic. When the sequences take their values in the finitefield ${\mathbb F}_q$, this also permits proving that the associated formalpower series are transcendental over ${\mathbb F}_q(X)$.

How to prove that a sequence is not automatic