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

Finite automata were used to determine multiple addresses in number systemsand to find topological properties of self-affine tiles and finite typefractals. We join these two lines of research by axiomatically definingautomata which generate topological spaces. Simple examples show the potentialof the concept. Spaces generated by automata are topologically self-similar.Two basic algorithms are outlined. The first one determines automata for all$k$-tuples of equivalent addresses from the automaton for double addresses. Thesecond one constructs finite topological spaces which approximate the generatedspace. Finally, we discuss the realization of automata-generated spaces asself-similar sets.

Elementary fractal geometry. 4. Automata-generated topological spaces