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 propose an automaton model which is a combination of symbolic and registerautomata, i.e., we enrich symbolic automata with memory. We call such automataRegister Match Automata (RMA). RMA extend the expressive power of symbolicautomata, by allowing formulas to be applied not only to the last element readfrom the input string, but to multiple elements, stored in their registers. RMAalso extend register automata, by allowing arbitrary formulas, besides equalitypredicates. We study the closure properties of RMA under union, concatenation,Kleene+, complement and determinization and show that RMA, contrary to symbolicautomata, are not determinizable when viewed as recognizers, without taking theoutput of transitions into account. However, when a window operator, aquintessential feature in Complex Event Processing, is used, RMA are indeeddeterminizable even when viewed as recognizers. We present detailed algorithmsfor constructing deterministic RMA from regular expressions extended with$n$-ary constraints. We show how RMA can be used in Complex Event Processing inorder to detect patterns upon streams of events, using a framework thatprovides denotational and compositional semantics, and that allows for asystematic treatment of such automata.

Symbolic Automata with Memory: a Computational Model for Complex Event Processing