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

We study synchronizing automata with the shortest reset words of relativelylarge length. First, we refine the Frankl-Pin result on the length of theshortest words of rank $m$, and the B\'eal, Berlinkov, Perrin, and Steinbergresults on the length of the shortest reset words in one-cluster automata. Theobtained results are useful in computation aimed in extending the class ofsmall automata for which the \v{C}ern\'y conjecture is verified and discoveringnew automata with special properties regarding synchronization.

Generating Synchronizing Automata with Large Reset Lengths