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 extend Antimirov's partial derivatives from regular expressions to$\mu$-regular expressions that describe context-free languages. We prove thecorrectness of partial derivatives as well as the finiteness of the set ofiterated partial derivatives. The latter are used as pushdown symbols in ourconstruction of a nondeterministic pushdown automaton, which generalizesAntimirov's NFA construction.

Partial Derivatives for Context-Free Languages: From $\mu$-Regular Expressions to Pushdown Automata