Sign in

Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and beyond)

By Christian Kindermann and others at
LogoStanford University
LogoUniversity of Manchester
In this paper, we introduce the problem of rewriting finite formal languages using syntactic macros such that the rewriting is minimal in size. We present polynomial-time algorithms to solve variants of this problem and show their correctness. To demonstrate the practical relevance of the proposed problems and the feasibility and... Show more
December 18, 2023
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...