2 papers
cs.FL2023
Final Sentential Forms
Tomáš Kožár, Zbyněk Křivka, Alexander Meduna
Let G be a context-free grammar with a total alphabet V, and let F be a final language over an alphabet W such that W is a subset of V. A final sentential form is any sentential fo…
cs.FL2022
Conclusive Tree-Controlled Grammars
Dominika Klobučníková, Zbyněk Křivka, Alexander Meduna
This paper presents a new approach to regulation of grammars. It divides the derivation trees generated by grammars into two sections-generative and conclusive (the conclusion). Th…