Filters
Phrase-Structure Grammars: Normal Forms and Reduction
in which both context-free rules and non-context-free rules are in prescribed forms. In addition, a limit is placed on the number of context-free rules. More specifical...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2016 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On Restricted Context-Free Grammars
with context-free rules and some mechanism controlling the application of rules, e. g., in random context grammars and their variants, a rule is only applicableif the currentIn context-<...
BA - Obecná matematika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
On restricted context-free grammars
Context-free grammars are widely used for the simple form of their rules the rules to be applied. In this paper, we study context-free grammars with a simpler and of an application of a rule
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On context-free rewriting with a simple restriction and its computational completeness
This paper discusses context-free rewriting systems in which there exist two disjoint finite sets of rules, and a symbol, referred to as a condition of applicability, is attached to each rule in either of these two...
BD - Teorie informace
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Generalized One-Sided Forbidding Grammars
In generalized one-sided forbidding grammars (GOFGs), each context-free rule in one of the two sets of rules contain only ordinary context-free rules without any forbidding strings charac...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2013 •
- Jost •
- Link
Rok uplatnění
Jost - Ostatní články v recenzovaných periodicích
Výsledek na webu
General CD Grammar Systems and Their Simplification
grammar systems with a context-free component and a non-context-free component. From the first type of transformations, the non-context-free component results with two rules the non-...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
On Normal Forms and Erasing Rules in Path-Controlled Grammars
This paper discusses path controlled grammars-context-free grammars with a root-to-leaf path in their derivation trees restricted by a control language. First, it investigates the impact of erasing rules on the generative p...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2014 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
One-Sided Random Context Grammars
The notion of a one-sided random context grammar is defined as a context-free into the set of left random context rules and the set of right random context rules. A left random contex...
IN - Informatika
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
LL Leftmost k-Linear Scattered Context Grammars
, the resulting context-free grammar is an LL grammar, and (3) every rule is appliedThe present paper introduces a new variant of a scattered context grammar, called an LL leftmost k-linear scattered context
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Professional Ethics and Judicial Free Speech: Criticism in Judicial System
The article deals with the criticizing of judicial decisions by the judge. In the context of the specific case the article strikes the problematic aspects of such a critical statement. The article emphasizes the ethical correctives regulatin...
Law
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 92 957