String rewriting sequential P-systems and regulated rewriting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F01%3A50000004" target="_blank" >RIV/47813059:19240/01:50000004 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
String rewriting sequential P-systems and regulated rewriting
Original language description
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 operators instead of multisets within sequential P-systems; this restriction is shown to be substantial, i.e., sequential P-systems of specific type using multisets are more powerful than the corresponding sequential P-systems using only sets
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F99%2F1086" target="_blank" >GA201/99/1086: Grammar systems and multiagent systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Developments in Language Theory
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
17
Pages from-to
405-41
Publisher name
Institut für Algebra und Computermathematik Technische Universität Wien
Place of publication
Rakousko
Event location
Vídeň, Rakousko
Event date
Jan 1, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—