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 develop a finite-state automata approach, implemented in a Maple package{\tt ToadsAndFrogs} available from our websites, for conjecturing, and thenrigorously proving, values for large families of positions in Richard Guy'scombinatorial game ``Toads and Frogs''. In particular, we prove a conjecture ofJeff Erickson.

A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory