The notion of a one-sided random context grammar is defined as a context-free-based
regulated grammar, in which a set of permitting symbols and a set of forbidding symbols are …

A left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set of
nonterminal symbols is attached to each context-free production. Such a production can …

Among many grammar models for picture description, cooperating context-free distributed
array grammar systems utilize the mechanism of cooperation between component array …

Abstract Consider ET0L grammars. Modify them such that a set of permitting symbols and a
set of forbidding symbols are attached to each of their rules, just like in random context …

One-Sided Random Context Grammars: Established Results and Open Problems Page 1
One-Sided Random Context Grammars: Established Results and Open Problems Petr Zemek …

Cooperating Distributed Grammar Systems with Random Context Grammars as
Components Page 1 Acta Cybernetica 20 (2011) 269–283. Cooperating Distributed …

The present thesis continues with study of grammar and automata systems. First of all, it
deals with regularly controlled CD grammar systems with phrase-structure grammars as …

In the seventh century before Christ, Egyptians believed they are the oldest nation in the
world. The former king, Psantek I., wanted to confirm this assumption. The confirmation was …

To live, work, and prosper on the Earth, people need to communicate, and they do so by
means of a broad variety of languages developed from the dawn of civilization up to today …

Bakalářská práce se zabývá zastřešením polyfunkčního domu v Brumově-Bylnici. Jedná se
o zpracování technologických předpisů pro tesařské a klempířské práce. Obsahem práce je …