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

A polyomino is said to be L-convex if any two of its cells are connected by a4-connected inner path that changes direction at most once. The 2-dimensionallanguage representing such polyominoes has been recently proved to berecognizable by tiling systems by S. Brocchi, A. Frosini, R. Pinzani and S.Rinaldi. In an attempt to compare recognition power of tiling systems andcellular automata, we have proved that this language can be recognized by2-dimensional cellular automata working on the von Neumann neighborhood in realtime.  Although the construction uses a characterization of L-convex polyominoesthat is similar to the one used for tiling systems, the real time constraintwhich has no equivalent in terms of tilings requires the use of techniques thatare specific to cellular automata.

L-Convex Polyominoes are Recognizable in Real Time by 2D Cellular Automata