One-sided random context grammars

A Meduna, P Zemek - Acta Informatica, 2011 - Springer
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 …

Left-forbidding cooperating distributed grammar systems

F Goldefus, T Masopust, A Meduna - Theoretical Computer Science, 2010 - Elsevier
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 …

[HTML][HTML] On the power of permitting features in cooperating context-free array grammar systems

KG Subramanian, I Venkat, E Csuhaj-Varjú - Discrete Applied Mathematics, 2013 - Elsevier
Among many grammar models for picture description, cooperating context-free distributed
array grammar systems utilize the mechanism of cooperation between component array …

Left random context ET0L grammars

A Meduna, P Zemek - Fundamenta Informaticae, 2013 - content.iospress.com
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 …

[PDF][PDF] One-sided random context grammars: Established results and open problems

P Zemek - Proceedings of the 19th Conference STUDENT …, 2013 - talks.petrzemek.net
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

Z Křivka, T Masopust - Acta Cybernetica, 2011 - cyber.bibl.u-szeged.hu
Cooperating Distributed Grammar Systems with Random Context Grammars as
Components Page 1 Acta Cybernetica 20 (2011) 269–283. Cooperating Distributed …

[PDF][PDF] Formal Systems Based upon Automata and Grammars

M Čermák - 2012 - theses.cz
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 …

[PDF][PDF] FORMAL SYSTEMS BASED UPON AUTOMATA AND GRAMMARS

PR ACE, VPR ACE - theses.cz
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 …

[PDF][PDF] Modern Language Models and Computation

A Meduna, O Soukup - library.sadjad.ac.ir
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 …

[PDF][PDF] VYSOKÉ UČENI TECHNICKE V BRNE

PA Šánek - 2018 - theses.cz
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 …