Estimating the execution complexity of logical specifications based on context-free grammars

DOI10.1007/BF02366772zbMath0880.68080OpenAlexW2087062265MaRDI QIDQ1369618

V. N. Glushkova

Publication date: 19 January 1998

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366772

zbMATH Keywords

context-free grammarsSIGMA-programming

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• Unnamed Item

Cites Work

• Composition aspects of programmology. I
• Composition aspects of programmology. II
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimating the execution complexity of logical specifications based on context-free grammars