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/

Zendy Plus

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

Zendy Tools

Zendy Open

We give a new characterization of primitive permutation groups tied to thenotion of completely reachable automata. Also, we introduce sync-maximalpermutation groups tied to the state complexity of the set of synchronizingwords of certain associated automata and show that they are contained betweenthe $2$-homogeneous and the primitive groups. Lastly, we define $k$-reachablegroups in analogy with synchronizing groups and motivated by ourcharacterization of primitive permutation groups. But the results show that a$k$-reachable permutation group of degree $n$ with $6 \le k \le n - 6$ iseither the alternating or the symmetric group.

Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words