Filters
Rule-based Modelling of Biological Systems Using Regulated Rewriting
. There are many modelling approaches, among which rewriting systems provide a framework description or substitute the missing details. For this purpose, we present regulation mechanisms, an extension of this formalism with addition...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Monotonicity of restarting automata
Restarting automata constitute a special class of regulated length-reducing rewriting systems. In this paper, several versions of these automata and a (strict) monotonicity property imposed on their computations are considered. This...
IN - Informatika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Regulated Rewriting in Natural Language Translation
to models with regulated rewriting. We present new definitions, and show simple examples...
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Regulated variants of limited context restarting automata
In the literature various types of restarting automata have been studied that are based on contextual rewriting. A word w is accepted by such an automaton of these contextual rewritings. Here we extend the limited context restarting...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Translations by Regulated Parallel Communicating Grammar Systems
Parallel communicating grammar systems (PCGSs) and their regulated variant (RPCGSs) generate languages. We introduce a translation as a binary relation between the words generated simultaneously by two components of such a system. Using samp...
IN - Informatika
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
String rewriting sequential P-systems and regulated rewriting
We investigate the computational power of generalized P-systems of specific types in comparsion with the computational power of certain control mechanisms for string rewriting grammars. An important restriction dwells in using sets of operat...
BD - Teorie informace
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Simple Semi-Conditional ET0L Grammars
A conditional variant of ET0L grammars, simple semi-conditional ET0L grammars, is studied. It is proven that the regulation based on context conditions significantly increases the generative power of ET0L grammars....
JC - Počítačový hardware a software
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Reduction of Simple-Semi-Conditional Grammars
This paper presents some method of minimalization of Simple-Semi-Conditinal Grammars
...
JC - Počítačový hardware a software
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Parsing Based on n-Path Tree-Controlled Grammars
that some non-context-free languages can be generated by this regulated rewriting model, and we recall several basic properties of such a rewriting system. Then, we study......
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On Vertical Restrictions of Grammatical Derivations
Traditional formal language theory is interested in some versions of grammars which are restricted in some ways. Most of them have restrictions in the form, which applies to current or following sentence. The others use some regulation on
JC - Počítačový hardware a software
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 32 734