Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Pattern systems

Identifieur interne : 002E63 ( Istex/Corpus ); précédent : 002E62; suivant : 002E64

Pattern systems

Auteurs : Victor Mitrana ; Gheorghe P Un ; Grzegorz Rozenberg ; Arto Salomaa

Source :

RBID : ISTEX:C46EBEDA91D9705029E6D058716C907BD0F7904E

English descriptors

Abstract

Abstract: We introduce a model that covers the recent studies on pattern languages (with or without erasing), multi-pattern languages, iterated pattern languages and languages of pattern grammars. The model, referred to as a pattern system, provides a uniform framework for all such studies. Moreover, it gives a new method of investigating certain basic families of developmental languages. This paper investigates the basics of the main types (general, synchronized, deterministic) of pattern systems. Open problems and topics for further research will be pointed out.

Url:
DOI: 10.1016/0304-3975(94)00258-4

Links to Exploration step

ISTEX:C46EBEDA91D9705029E6D058716C907BD0F7904E

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title>Pattern systems</title>
<author>
<name sortKey="Mitrana, Victor" sort="Mitrana, Victor" uniqKey="Mitrana V" first="Victor" last="Mitrana">Victor Mitrana</name>
<affiliation>
<mods:affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="P Un, Gheorghe" sort="P Un, Gheorghe" uniqKey="P Un G" first="Gheorghe" last="P Un">Gheorghe P Un</name>
<affiliation>
<mods:affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Rozenberg, Grzegorz" sort="Rozenberg, Grzegorz" uniqKey="Rozenberg G" first="Grzegorz" last="Rozenberg">Grzegorz Rozenberg</name>
<affiliation>
<mods:affiliation>Department of Computer Science, Leiden University, 2300 RA Leiden, The Netherlands</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Salomaa, Arto" sort="Salomaa, Arto" uniqKey="Salomaa A" first="Arto" last="Salomaa">Arto Salomaa</name>
<affiliation>
<mods:affiliation>Corresponding author.</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>University of Turku, Department of Mathematics, SF-20500, Turku, Finland</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>1asalomaa@ut</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:C46EBEDA91D9705029E6D058716C907BD0F7904E</idno>
<date when="1996" year="1996">1996</date>
<idno type="doi">10.1016/0304-3975(94)00258-4</idno>
<idno type="url">https://api.istex.fr/ark:/67375/6H6-B7LK05TJ-4/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002E63</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E63</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a">Pattern systems</title>
<author>
<name sortKey="Mitrana, Victor" sort="Mitrana, Victor" uniqKey="Mitrana V" first="Victor" last="Mitrana">Victor Mitrana</name>
<affiliation>
<mods:affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="P Un, Gheorghe" sort="P Un, Gheorghe" uniqKey="P Un G" first="Gheorghe" last="P Un">Gheorghe P Un</name>
<affiliation>
<mods:affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Rozenberg, Grzegorz" sort="Rozenberg, Grzegorz" uniqKey="Rozenberg G" first="Grzegorz" last="Rozenberg">Grzegorz Rozenberg</name>
<affiliation>
<mods:affiliation>Department of Computer Science, Leiden University, 2300 RA Leiden, The Netherlands</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Salomaa, Arto" sort="Salomaa, Arto" uniqKey="Salomaa A" first="Arto" last="Salomaa">Arto Salomaa</name>
<affiliation>
<mods:affiliation>Corresponding author.</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>University of Turku, Department of Mathematics, SF-20500, Turku, Finland</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>1asalomaa@ut</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">Theoretical Computer Science</title>
<title level="j" type="abbrev">TCS</title>
<idno type="ISSN">0304-3975</idno>
<imprint>
<publisher>ELSEVIER</publisher>
<date type="published" when="1996">1996</date>
<biblScope unit="volume">154</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="page" from="183">183</biblScope>
<biblScope unit="page" to="201">201</biblScope>
</imprint>
<idno type="ISSN">0304-3975</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="Teeft" xml:lang="en">
<term>7dsm</term>
<term>7dsn</term>
<term>Academic press</term>
<term>Basic problem</term>
<term>Computer science</term>
<term>Developmental languages</term>
<term>Disjoint sets</term>
<term>Dnspl</term>
<term>Dsspl</term>
<term>Equivalence problem</term>
<term>Family dnspl</term>
<term>Formal language theory</term>
<term>Induction hypothesis</term>
<term>Iterated pattern languages</term>
<term>Mitrana</term>
<term>Morphisms</term>
<term>Nspl</term>
<term>Open problems</term>
<term>Pattern grammars</term>
<term>Pattern languages</term>
<term>Pattern system</term>
<term>Pattern systems</term>
<term>Previous step</term>
<term>Regular sets</term>
<term>Salomaa</term>
<term>Terminal words</term>
<term>Theoretical computer science</term>
<term>Various types</term>
<term>Weak synchronization</term>
<term>Word sequences</term>
<term>Wspl</term>
</keywords>
</textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: We introduce a model that covers the recent studies on pattern languages (with or without erasing), multi-pattern languages, iterated pattern languages and languages of pattern grammars. The model, referred to as a pattern system, provides a uniform framework for all such studies. Moreover, it gives a new method of investigating certain basic families of developmental languages. This paper investigates the basics of the main types (general, synchronized, deterministic) of pattern systems. Open problems and topics for further research will be pointed out.</div>
</front>
</TEI>
<istex>
<corpusName>elsevier</corpusName>
<keywords>
<teeft>
<json:string>nspl</json:string>
<json:string>mitrana</json:string>
<json:string>pattern systems</json:string>
<json:string>theoretical computer science</json:string>
<json:string>wspl</json:string>
<json:string>dnspl</json:string>
<json:string>pattern system</json:string>
<json:string>salomaa</json:string>
<json:string>7dsm</json:string>
<json:string>dsspl</json:string>
<json:string>terminal words</json:string>
<json:string>morphisms</json:string>
<json:string>7dsn</json:string>
<json:string>pattern languages</json:string>
<json:string>computer science</json:string>
<json:string>pattern grammars</json:string>
<json:string>previous step</json:string>
<json:string>weak synchronization</json:string>
<json:string>academic press</json:string>
<json:string>developmental languages</json:string>
<json:string>open problems</json:string>
<json:string>basic problem</json:string>
<json:string>various types</json:string>
<json:string>word sequences</json:string>
<json:string>family dnspl</json:string>
<json:string>equivalence problem</json:string>
<json:string>induction hypothesis</json:string>
<json:string>iterated pattern languages</json:string>
<json:string>formal language theory</json:string>
<json:string>regular sets</json:string>
<json:string>disjoint sets</json:string>
</teeft>
</keywords>
<author>
<json:item>
<name>Victor Mitrana</name>
<affiliations>
<json:string>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</json:string>
</affiliations>
</json:item>
<json:item>
<name>Gheorghe Păun</name>
<affiliations>
<json:string>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</json:string>
</affiliations>
</json:item>
<json:item>
<name>Grzegorz Rozenberg</name>
<affiliations>
<json:string>Department of Computer Science, Leiden University, 2300 RA Leiden, The Netherlands</json:string>
</affiliations>
</json:item>
<json:item>
<name>Arto Salomaa</name>
<affiliations>
<json:string>Corresponding author.</json:string>
<json:string>University of Turku, Department of Mathematics, SF-20500, Turku, Finland</json:string>
<json:string>1asalomaa@ut</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/6H6-B7LK05TJ-4</arkIstex>
<language>
<json:string>eng</json:string>
</language>
<originalGenre>
<json:string>Full-length article</json:string>
</originalGenre>
<abstract>Abstract: We introduce a model that covers the recent studies on pattern languages (with or without erasing), multi-pattern languages, iterated pattern languages and languages of pattern grammars. The model, referred to as a pattern system, provides a uniform framework for all such studies. Moreover, it gives a new method of investigating certain basic families of developmental languages. This paper investigates the basics of the main types (general, synchronized, deterministic) of pattern systems. Open problems and topics for further research will be pointed out.</abstract>
<qualityIndicators>
<refBibsNative>true</refBibsNative>
<abstractWordCount>83</abstractWordCount>
<abstractCharCount>570</abstractCharCount>
<keywordCount>0</keywordCount>
<score>7.996</score>
<pdfWordCount>6062</pdfWordCount>
<pdfCharCount>30250</pdfCharCount>
<pdfVersion>1.2</pdfVersion>
<pdfPageCount>19</pdfPageCount>
<pdfPageSize>504 x 720 pts</pdfPageSize>
</qualityIndicators>
<title>Pattern systems</title>
<pii>
<json:string>0304-3975(94)00258-4</json:string>
</pii>
<genre>
<json:string>research-article</json:string>
</genre>
<serie>
<title>ICALP 80 Proceedings</title>
<language>
<json:string>unknown</json:string>
</language>
<pages>
<first>19</first>
<last>29</last>
</pages>
</serie>
<host>
<title>Theoretical Computer Science</title>
<language>
<json:string>unknown</json:string>
</language>
<publicationDate>1996</publicationDate>
<issn>
<json:string>0304-3975</json:string>
</issn>
<pii>
<json:string>S0304-3975(00)X0012-6</json:string>
</pii>
<volume>154</volume>
<issue>2</issue>
<pages>
<first>183</first>
<last>201</last>
</pages>
<genre>
<json:string>journal</json:string>
</genre>
</host>
<namedEntities>
<unitex>
<date>
<json:string>1994</json:string>
<json:string>1996</json:string>
</date>
<geogName></geogName>
<orgName>
<json:string>Pattern Systems</json:string>
<json:string>Pattern Systems We</json:string>
<json:string>L Systems</json:string>
<json:string>Finland Received</json:string>
<json:string>DOL Systems</json:string>
<json:string>Academy of Fin</json:string>
<json:string>Institute of Mathematics of the Romanian Academy of Sciences, PO Box</json:string>
<json:string>PDTOL Systems Gj</json:string>
<json:string>Lindenmayer Systems</json:string>
<json:string>University of Turku</json:string>
</orgName>
<orgName_funder></orgName_funder>
<orgName_provider></orgName_provider>
<persName>
<json:string>V. Mitrana</json:string>
<json:string>I.Ua</json:string>
<json:string>M. Nivat</json:string>
<json:string>JO Llyqe</json:string>
<json:string>Some</json:string>
<json:string>T. Denote</json:string>
</persName>
<placeName>
<json:string>Turku</json:string>
<json:string>Netherlands</json:string>
</placeName>
<ref_url></ref_url>
<ref_bibl>
<json:string>[4]</json:string>
<json:string>Jiang et al.</json:string>
<json:string>[12]</json:string>
<json:string>[6]</json:string>
<json:string>Department of Computer Science, Leiden University, 2300</json:string>
<json:string>Mitrana et al.</json:string>
<json:string>V. Mitrana et al.</json:string>
<json:string>[2]</json:string>
<json:string>[13]</json:string>
<json:string>Kari et al. [7]</json:string>
</ref_bibl>
<bibl></bibl>
</unitex>
</namedEntities>
<ark>
<json:string>ark:/67375/6H6-B7LK05TJ-4</json:string>
</ark>
<categories>
<wos>
<json:string>1 - science</json:string>
<json:string>2 - computer science, theory & methods</json:string>
</wos>
<scienceMetrix>
<json:string>1 - applied sciences</json:string>
<json:string>2 - information & communication technologies</json:string>
<json:string>3 - computation theory & mathematics</json:string>
</scienceMetrix>
<scopus>
<json:string>1 - Physical Sciences</json:string>
<json:string>2 - Computer Science</json:string>
<json:string>3 - General Computer Science</json:string>
<json:string>1 - Physical Sciences</json:string>
<json:string>2 - Mathematics</json:string>
<json:string>3 - Theoretical Computer Science</json:string>
</scopus>
<inist>
<json:string>1 - sciences humaines et sociales</json:string>
</inist>
</categories>
<publicationDate>1996</publicationDate>
<copyrightDate>1996</copyrightDate>
<doi>
<json:string>10.1016/0304-3975(94)00258-4</json:string>
</doi>
<id>C46EBEDA91D9705029E6D058716C907BD0F7904E</id>
<score>1</score>
<fulltext>
<json:item>
<extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/6H6-B7LK05TJ-4/fulltext.pdf</uri>
</json:item>
<json:item>
<extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/6H6-B7LK05TJ-4/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/6H6-B7LK05TJ-4/fulltext.tei">
<teiHeader>
<fileDesc>
<titleStmt>
<title level="a">Pattern systems</title>
</titleStmt>
<publicationStmt>
<authority>ISTEX</authority>
<publisher scheme="https://scientific-publisher.data.istex.fr">ELSEVIER</publisher>
<availability>
<licence>
<p>elsevier</p>
</licence>
</availability>
<p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M"></p>
<date>1996</date>
</publicationStmt>
<notesStmt>
<note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note>
<note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note>
<note>Research supported by the Academy of Finland project 11281.</note>
<note>Communicated by M. Nivat</note>
<note type="content">Section title: Regular paper</note>
</notesStmt>
<sourceDesc>
<biblStruct type="inbook">
<analytic>
<title level="a">Pattern systems</title>
<author xml:id="author-0000">
<persName>
<forename type="first">Victor</forename>
<surname>Mitrana</surname>
</persName>
<affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</affiliation>
</author>
<author xml:id="author-0001">
<persName>
<forename type="first">Gheorghe</forename>
<surname>Păun</surname>
</persName>
<affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</affiliation>
</author>
<author xml:id="author-0002">
<persName>
<forename type="first">Grzegorz</forename>
<surname>Rozenberg</surname>
</persName>
<affiliation>Department of Computer Science, Leiden University, 2300 RA Leiden, The Netherlands</affiliation>
</author>
<author xml:id="author-0003">
<persName>
<forename type="first">Arto</forename>
<surname>Salomaa</surname>
</persName>
<affiliation>Corresponding author.</affiliation>
<affiliation>University of Turku, Department of Mathematics, SF-20500, Turku, Finland</affiliation>
<affiliation>1asalomaa@ut</affiliation>
</author>
<idno type="istex">C46EBEDA91D9705029E6D058716C907BD0F7904E</idno>
<idno type="ark">ark:/67375/6H6-B7LK05TJ-4</idno>
<idno type="DOI">10.1016/0304-3975(94)00258-4</idno>
<idno type="PII">0304-3975(94)00258-4</idno>
</analytic>
<monogr>
<title level="j">Theoretical Computer Science</title>
<title level="j" type="abbrev">TCS</title>
<idno type="pISSN">0304-3975</idno>
<idno type="PII">S0304-3975(00)X0012-6</idno>
<imprint>
<publisher>ELSEVIER</publisher>
<date type="published" when="1996"></date>
<biblScope unit="volume">154</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="page" from="183">183</biblScope>
<biblScope unit="page" to="201">201</biblScope>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<creation>
<date>1996</date>
</creation>
<langUsage>
<language ident="en">en</language>
</langUsage>
<abstract xml:lang="en">
<p>Abstract: We introduce a model that covers the recent studies on pattern languages (with or without erasing), multi-pattern languages, iterated pattern languages and languages of pattern grammars. The model, referred to as a pattern system, provides a uniform framework for all such studies. Moreover, it gives a new method of investigating certain basic families of developmental languages. This paper investigates the basics of the main types (general, synchronized, deterministic) of pattern systems. Open problems and topics for further research will be pointed out.</p>
</abstract>
</profileDesc>
<revisionDesc>
<change when="1996">Published</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item>
<extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/6H6-B7LK05TJ-4/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata>
<istex:metadataXml wicri:clean="Elsevier, elements deleted: tail">
<istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType">
<istex:entity SYSTEM="fx1" NDATA="IMAGE" name="fx1"></istex:entity>
</istex:docType>
<istex:document>
<converted-article version="4.5.2" docsubtype="fla">
<item-info>
<jid>TCS</jid>
<aid>94002584</aid>
<ce:pii>0304-3975(94)00258-4</ce:pii>
<ce:doi>10.1016/0304-3975(94)00258-4</ce:doi>
<ce:copyright type="unknown" year="1996"></ce:copyright>
</item-info>
<head>
<ce:article-footnote>
<ce:label></ce:label>
<ce:note-para>Research supported by the Academy of Finland project 11281.</ce:note-para>
</ce:article-footnote>
<ce:dochead>
<ce:textfn>Regular paper</ce:textfn>
</ce:dochead>
<ce:title>Pattern systems</ce:title>
<ce:author-group>
<ce:author>
<ce:given-name>Victor</ce:given-name>
<ce:surname>Mitrana</ce:surname>
<ce:cross-ref refid="AFF1">
<ce:sup>a</ce:sup>
</ce:cross-ref>
</ce:author>
<ce:author>
<ce:given-name>Gheorghe</ce:given-name>
<ce:surname>Păun</ce:surname>
<ce:cross-ref refid="AFF1">
<ce:sup>a</ce:sup>
</ce:cross-ref>
</ce:author>
<ce:author>
<ce:given-name>Grzegorz</ce:given-name>
<ce:surname>Rozenberg</ce:surname>
<ce:cross-ref refid="AFF2">
<ce:sup>b</ce:sup>
</ce:cross-ref>
</ce:author>
<ce:author>
<ce:given-name>Arto</ce:given-name>
<ce:surname>Salomaa</ce:surname>
<ce:cross-ref refid="COR1">
<ce:sup></ce:sup>
</ce:cross-ref>
<ce:cross-ref refid="AFF3">
<ce:sup>c</ce:sup>
</ce:cross-ref>
<ce:cross-ref refid="FN1">
<ce:sup>1</ce:sup>
</ce:cross-ref>
</ce:author>
<ce:affiliation id="AFF1">
<ce:label>a</ce:label>
<ce:textfn>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</ce:textfn>
</ce:affiliation>
<ce:affiliation id="AFF2">
<ce:label>b</ce:label>
<ce:textfn>Department of Computer Science, Leiden University, 2300 RA Leiden, The Netherlands</ce:textfn>
</ce:affiliation>
<ce:affiliation id="AFF3">
<ce:label>c</ce:label>
<ce:textfn>University of Turku, Department of Mathematics, SF-20500, Turku, Finland</ce:textfn>
</ce:affiliation>
<ce:correspondence id="COR1">
<ce:label></ce:label>
<ce:text>Corresponding author.</ce:text>
</ce:correspondence>
<ce:footnote id="FN1">
<ce:label>1</ce:label>
<ce:note-para>asalomaa@ut
<ce:inline-figure>
<ce:link locator="fx1"></ce:link>
</ce:inline-figure>
</ce:note-para>
</ce:footnote>
</ce:author-group>
<ce:miscellaneous>Communicated by M. Nivat</ce:miscellaneous>
<ce:abstract>
<ce:section-title>Abstract</ce:section-title>
<ce:abstract-sec>
<ce:simple-para>We introduce a model that covers the recent studies on pattern languages (with or without erasing), multi-pattern languages, iterated pattern languages and languages of pattern grammars. The model, referred to as a pattern system, provides a uniform framework for all such studies. Moreover, it gives a new method of investigating certain basic families of developmental languages. This paper investigates the basics of the main types (general, synchronized, deterministic) of pattern systems. Open problems and topics for further research will be pointed out.</ce:simple-para>
</ce:abstract-sec>
</ce:abstract>
</head>
</converted-article>
</istex:document>
</istex:metadataXml>
<mods version="3.6">
<titleInfo>
<title>Pattern systems</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA">
<title>Pattern systems</title>
</titleInfo>
<name type="personal">
<namePart type="given">Victor</namePart>
<namePart type="family">Mitrana</namePart>
<affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Gheorghe</namePart>
<namePart type="family">Păun</namePart>
<affiliation>Institute of Mathematics of the Romanian Academy of Sciences, PO Box 1-764, 70700 Bucureşti, Romania</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Grzegorz</namePart>
<namePart type="family">Rozenberg</namePart>
<affiliation>Department of Computer Science, Leiden University, 2300 RA Leiden, The Netherlands</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Arto</namePart>
<namePart type="family">Salomaa</namePart>
<affiliation>Corresponding author.</affiliation>
<affiliation>University of Turku, Department of Mathematics, SF-20500, Turku, Finland</affiliation>
<affiliation>1asalomaa@ut</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="research-article" displayLabel="Full-length article" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre>
<originInfo>
<publisher>ELSEVIER</publisher>
<dateIssued encoding="w3cdtf">1996</dateIssued>
<copyrightDate encoding="w3cdtf">1996</copyrightDate>
</originInfo>
<language>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
<languageTerm type="code" authority="rfc3066">en</languageTerm>
</language>
<abstract lang="en">Abstract: We introduce a model that covers the recent studies on pattern languages (with or without erasing), multi-pattern languages, iterated pattern languages and languages of pattern grammars. The model, referred to as a pattern system, provides a uniform framework for all such studies. Moreover, it gives a new method of investigating certain basic families of developmental languages. This paper investigates the basics of the main types (general, synchronized, deterministic) of pattern systems. Open problems and topics for further research will be pointed out.</abstract>
<note>Research supported by the Academy of Finland project 11281.</note>
<note>Communicated by M. Nivat</note>
<note type="content">Section title: Regular paper</note>
<relatedItem type="host">
<titleInfo>
<title>Theoretical Computer Science</title>
</titleInfo>
<titleInfo type="abbreviated">
<title>TCS</title>
</titleInfo>
<genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre>
<originInfo>
<publisher>ELSEVIER</publisher>
<dateIssued encoding="w3cdtf">1996</dateIssued>
</originInfo>
<identifier type="ISSN">0304-3975</identifier>
<identifier type="PII">S0304-3975(00)X0012-6</identifier>
<part>
<date>1996</date>
<detail type="volume">
<number>154</number>
<caption>vol.</caption>
</detail>
<detail type="issue">
<number>2</number>
<caption>no.</caption>
</detail>
<extent unit="issue-pages">
<start>145</start>
<end>396</end>
</extent>
<extent unit="pages">
<start>183</start>
<end>201</end>
</extent>
</part>
</relatedItem>
<identifier type="istex">C46EBEDA91D9705029E6D058716C907BD0F7904E</identifier>
<identifier type="ark">ark:/67375/6H6-B7LK05TJ-4</identifier>
<identifier type="DOI">10.1016/0304-3975(94)00258-4</identifier>
<identifier type="PII">0304-3975(94)00258-4</identifier>
<recordInfo>
<recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M">elsevier</recordContentSource>
</recordInfo>
</mods>
<json:item>
<extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/6H6-B7LK05TJ-4/record.json</uri>
</json:item>
</metadata>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E63 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002E63 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:C46EBEDA91D9705029E6D058716C907BD0F7904E
   |texte=   Pattern systems
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022