The execution complexity of logical formulas with restricted quantifiers based on CF-grammars
2021 ◽
Vol 2131
(2)
◽
pp. 022131
Keyword(s):
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.
1998 ◽
Vol 8
(1)
◽
pp. 1-22
◽
1972 ◽
Vol 3
(1-4)
◽
pp. 315-345
◽
Keyword(s):