Rule Forms in Rewriting Systems

Alhazov Artiom; Freund Rudolf; Ivanov Sergiu

Articolul precedent

Articolul urmator

552

SM ISO690:2012

ALHAZOV, Artiom, FREUND, Rudolf, IVANOV, Sergiu. Rule Forms in Rewriting Systems. In: Proceedings IMCS-55: The Fifth Conference of Mathematical Society of the Republic of Moldova, 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2019, pp. 283-292. ISBN 978-9975-68-378-4.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Proceedings IMCS-55 2019

Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chișinău, Moldova, 28 septembrie - 1 octombrie 2019

Rule Forms in Rewriting Systems

Pag. 283-292

Alhazov Artiom, Freund Rudolf, Ivanov Sergiu

Vladimir Andrunachievici Institute of Mathematics and Computer Science

Disponibil în IBN: 29 noiembrie 2019

Descarcă PDF

Rezumat

We discuss which sets of patterns for rules are sufficient for reaching computational completeness in various rewriting systems, for example, sequential generating grammars and accepting machines as Turing machines and circular Post machines; special attention is paid to the parallel model of membrane systems.

Cuvinte-cheie
theoretical computer science, rewriting systems, Membrane computing, normal form

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-88859</cfResPublId>
<cfResPublDate>2019</cfResPublDate>
<cfStartPage>283</cfStartPage>
<cfISBN>978-9975-68-378-4</cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/88859</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Rule Forms in Rewriting Systems</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>theoretical computer science; rewriting systems; Membrane computing; normal form</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>We discuss which sets of patterns for rules are sufficient for reaching computational completeness in various rewriting systems, for example, sequential generating grammars and accepting machines as Turing machines and circular Post machines; special attention is paid to the parallel model of membrane systems.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-13033</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-22100</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-20300</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-13033</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-13033-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Alhazov</cfFamilyNames>
<cfFirstNames>Artiom</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-22100</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-22100-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Freund</cfFamilyNames>
<cfFirstNames>Rudolf</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-20300</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-20300-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Ivanov</cfFamilyNames>
<cfFirstNames>Sergiu</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>