Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Stiebe, Ralf"'
Autor:
Stiebe, Ralf, Turaev, Sherzod
Publikováno v:
EPTCS 3, 2009, pp. 193-203
A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and
Externí odkaz:
http://arxiv.org/abs/0907.5136
Publikováno v:
In Theoretical Computer Science 2009 410(35):3261-3271
Autor:
Stiebe, Ralf
Publikováno v:
In Information and Computation 2008 206(9):1248-1258
Autor:
Fernau, Henning *, Stiebe, Ralf
Publikováno v:
In Theoretical Computer Science 2002 276(1):377-405
Autor:
Mitrana, Victor *, Stiebe, Ralf
Publikováno v:
In Discrete Applied Mathematics 2001 108(3):287-300
Autor:
Dassow, Jürgen1 dassow@iws.cs.uni-magdeburg.de, Stiebe, Ralf1 stiebe@iws.cs.uni-magdeburg.de
Publikováno v:
Fundamenta Informaticae. 2008, Vol. 83 Issue 1-2, p35-49. 15p.
Autor:
Fernau, Henning1 fernau@uni-trier.de, Stiebe, Ralf2 stiebe@iws.cs.uni-magdeburg.de
Publikováno v:
Fundamenta Informaticae. 2008, Vol. 83 Issue 1-2, p51-64. 14p.
Autor:
Fernau, Henning, Stiebe, Ralf
Publikováno v:
Fundamenta Informaticae. Mar2001, Vol. 45 Issue 4, p329. 30p.
Autor:
Stiebe, Ralf, Turaev, Sherzod
A capacity-bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity-bounded grammars and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b867fa89baed1be0e8337f28f46a8ef
We discuss a particular type of weighted grammars and automata over the partially ordered group of additive real vectors $\mathbb{R}^k$, and its subgroups $\mathbb{Z}^k$ and $\mathbb{Q}^k$, as well as over the partially ordered group of component-wis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c396d514cc099d2228bfbaa78b78f6a