The execution complexity of logical formulas with restricted quantifiers based on CF-grammars
Ksenia Korovina, I Sh Rudova · Journal of Physics Conference Series · 2021
Abstract The polynomial realized formulas are introduced with quantifiers acting on hierarchy lists described by CF-grammars. Upper estimates of execution complexity are obtained depending from the sort of grammar. These formulas have been applied for formal definition of context-dependent syntax of programming languages and describing dynamic discrete system.