About Precise Characterization of Languages
Generated by Hybrid Networks of Evolutionary
Processors with One Node

Alhazov Artiom; Rogojin Vladimir

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

972

Ultima descărcare din IBN:
2021-04-27 20:02

Căutarea după subiecte
similare conform CZU

004.27:519.16 (1)

Arhitectura calculatoarelor (11)

Analiză combinatorică. Teoria grafurilor (115)

SM ISO690:2012

ALHAZOV, Artiom, ROGOJIN, Vladimir. About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node. In: Computer Science Journal of Moldova, 2008, nr. 3(48), pp. 364-376. ISSN 1561-4042.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Computer Science Journal of Moldova

Numărul 3(48) / 2008 / ISSN 1561-4042 /ISSNe 2587-4330

About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node

CZU: 004.27:519.16

Pag. 364-376

Alhazov Artiom¹, Rogojin Vladimir¹²

¹ Institute of Mathematics and Computer Science ASM,
² Universitat Rovira i Virgili - La universitat pública de Tarragona

Disponibil în IBN: 2 decembrie 2013

Descarcă PDF

Rezumat

A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an input ﬁlter and an output ﬁlter. Every evolutionary processor is given with a ﬁnite set of one type of point mutations (an insertion, a deletion or a substitution of a symbol) which can be applied to certain positions of a string over the domain of the set of these rewriting rules. The HNEP functions by rewriting the words that can be found at the nodes and then re-distributing the resulting strings according to a communication protocol based on a ﬁltering mechanism. The ﬁlters are deﬁned by certain variants of random-context conditions. In this paper we complete investigation of HNEPs with one node and present a precise description of languages generated by them.

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-2590</cfResPublId>
<cfResPublDate>2008-12-05</cfResPublDate>
<cfVol>48</cfVol>
<cfIssue>3</cfIssue>
<cfStartPage>364</cfStartPage>
<cfISSN>1561-4042</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/2590</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>About Precise Characterization of Languages
Generated by Hybrid Networks of Evolutionary
Processors with One Node</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'>A hybrid network of evolutionary processors (an HNEP) is a
 graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an input ﬁlter and an output ﬁlter. Every evolutionary processor is given
 with a ﬁnite set of one type of point mutations (an insertion, a
 deletion or a substitution of a symbol) which can be applied to
 certain positions of a string over the domain of the set of these

rewriting rules. The HNEP functions by rewriting the words that
 can be found at the nodes and then re-distributing the resulting
 strings according to a communication protocol based on a ﬁltering mechanism. The ﬁlters are deﬁned by certain variants of

random-context conditions. In this paper we complete investigation of HNEPs with one node and present a precise description
 of languages generated by them.</cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2008-12-05T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2008-12-05T24: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>2008-12-05T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-16569</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2008-12-05T24: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>2008-12-05T24:00:00</cfStartDate>
<cfFamilyNames>Alhazov</cfFamilyNames>
<cfFirstNames>Artiom</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-16569</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-16569-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2008-12-05T24:00:00</cfStartDate>
<cfFamilyNames>Rogojin</cfFamilyNames>
<cfFirstNames>Vladimir</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>