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

Finite-state tree automata are a well studied formalism for representing termlanguages. This paper studies the problem of determining the regularity of theset of instances of a finite set of terms with variables, where each variableis restricted to instantiations of a regular set given by a tree automaton. Theproblem was recently proved decidable, but with an unknown complexity. Here,the exact complexity of the problem is determined by provingEXPTIME-completeness. The main contribution is a new, exponential timealgorithm that performs various exponential transformations on the involvedterms and tree automata, and decides regularity by analyzing formulas overinequality and height predicates.

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete