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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Codes with various kinds of decipherability, weaker than the usual uniquedecipherability, have been studied since multiset decipherability wasintroduced in mid-1980s. We consider decipherability of directed figure codes,where directed figures are defined as labelled polyominoes with designatedstart and end points, equipped with catenation operation that may use a mergingfunction to resolve possible conflicts. This is one of possible extensionsgeneralizing words and variable-length codes to planar structures. Here,verification whether a given set is a code is no longer decidable in general.We study the decidability status of figure codes depending on catenation type(with or without a merging function), decipherability kind (unique, multiset,set or numeric) and code geometry (several classes determined by relativepositions of start and end points of figures). We give decidability orundecidability proofs in all but two cases that remain open.

Decidability of multiset, set and numerically decipherable directed figure codes