3 citations · 3 across the 5 of their papers we have counts for
5 papers
How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
Martin Havel, Zbyněk Křivka, Alexander Meduna
This paper introduces derivation trees for general grammars. Within these trees, it defines context-dependent pairs of nodes, corresponding to rewriting two neighboring symbols usi…
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…
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…
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
Alexander Meduna, Jakub Martiško
The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this probl…
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
Tomáš Masopust, Alexander Meduna
Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that constr…