Partial array-rewriting P systems and basic puzzle partial array grammars
In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is i...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | |
| container_title | |
| container_volume | 2277 |
| creator | Sweety, F. Sasikala, K. Kalyani, T. Thomas, D. G. |
| description | In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages. We compare these grammars for generating powers. We have also generated partial array languages using extended and non extended partial array rewriting p-system. This is compared with basic puzzle partial array grammar. |
| doi_str_mv | 10.1063/5.0027078 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_scita</sourceid><recordid>TN_cdi_proquest_journals_2458207294</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2458207294</sourcerecordid><originalsourceid>FETCH-LOGICAL-p2038-10398b33b016e2109d4691ce1f31c41c6a5a95af38a48632a23cc550db2a49643</originalsourceid><addsrcrecordid>eNp90E1LAzEQBuAgCtbqwX8Q8CZsnXzu5ihFa6FgDwrewmw2W1La3TXZKu2vt6UFPXmayzPvDC8htwxGDLR4UCMAnkNenJEBU4pluWb6nAwAjMy4FB-X5Cql5R6ZPC8GZDrH2AdcUYwRt1n03zH0oVnQOU3b1Pt1othUtMQUHO02u93K0-7vCl1EXK8xpmtyUeMq-ZvTHJL356e38Us2e51Mx4-zrOMgioyBMEUpRAlMe87AVFIb5jyrBXOSOY0KjcJaFCgLLThy4ZxSUJUcpdFSDMndMbeL7efGp94u201s9ictl6rgkHNzUPdHlVzosQ9tY7sY9n9uLQN7qMoqe6rqP_zVxl9ou6oWP0DUaLg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>2458207294</pqid></control><display><type>conference_proceeding</type><title>Partial array-rewriting P systems and basic puzzle partial array grammars</title><source>AIP Journals Complete</source><creator>Sweety, F. ; Sasikala, K. ; Kalyani, T. ; Thomas, D. G.</creator><contributor>Behra, Harekrushna ; Balaji, N ; Gajendran, G ; Govindarajan, A</contributor><creatorcontrib>Sweety, F. ; Sasikala, K. ; Kalyani, T. ; Thomas, D. G. ; Behra, Harekrushna ; Balaji, N ; Gajendran, G ; Govindarajan, A</creatorcontrib><description>In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages. We compare these grammars for generating powers. We have also generated partial array languages using extended and non extended partial array rewriting p-system. This is compared with basic puzzle partial array grammar.</description><identifier>ISSN: 0094-243X</identifier><identifier>EISSN: 1551-7616</identifier><identifier>DOI: 10.1063/5.0027078</identifier><identifier>CODEN: APCPCS</identifier><language>eng</language><publisher>Melville: American Institute of Physics</publisher><subject>Arrays ; Grammars ; Languages</subject><ispartof>AIP conference proceedings, 2020, Vol.2277 (1)</ispartof><rights>Author(s)</rights><rights>2020 Author(s). Published by AIP Publishing.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubs.aip.org/acp/article-lookup/doi/10.1063/5.0027078$$EHTML$$P50$$Gscitation$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,794,4510,23929,23930,25139,27923,27924,76155</link.rule.ids></links><search><contributor>Behra, Harekrushna</contributor><contributor>Balaji, N</contributor><contributor>Gajendran, G</contributor><contributor>Govindarajan, A</contributor><creatorcontrib>Sweety, F.</creatorcontrib><creatorcontrib>Sasikala, K.</creatorcontrib><creatorcontrib>Kalyani, T.</creatorcontrib><creatorcontrib>Thomas, D. G.</creatorcontrib><title>Partial array-rewriting P systems and basic puzzle partial array grammars</title><title>AIP conference proceedings</title><description>In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages. We compare these grammars for generating powers. We have also generated partial array languages using extended and non extended partial array rewriting p-system. This is compared with basic puzzle partial array grammar.</description><subject>Arrays</subject><subject>Grammars</subject><subject>Languages</subject><issn>0094-243X</issn><issn>1551-7616</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2020</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNp90E1LAzEQBuAgCtbqwX8Q8CZsnXzu5ihFa6FgDwrewmw2W1La3TXZKu2vt6UFPXmayzPvDC8htwxGDLR4UCMAnkNenJEBU4pluWb6nAwAjMy4FB-X5Cql5R6ZPC8GZDrH2AdcUYwRt1n03zH0oVnQOU3b1Pt1othUtMQUHO02u93K0-7vCl1EXK8xpmtyUeMq-ZvTHJL356e38Us2e51Mx4-zrOMgioyBMEUpRAlMe87AVFIb5jyrBXOSOY0KjcJaFCgLLThy4ZxSUJUcpdFSDMndMbeL7efGp94u201s9ictl6rgkHNzUPdHlVzosQ9tY7sY9n9uLQN7qMoqe6rqP_zVxl9ou6oWP0DUaLg</recordid><startdate>20201106</startdate><enddate>20201106</enddate><creator>Sweety, F.</creator><creator>Sasikala, K.</creator><creator>Kalyani, T.</creator><creator>Thomas, D. G.</creator><general>American Institute of Physics</general><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope></search><sort><creationdate>20201106</creationdate><title>Partial array-rewriting P systems and basic puzzle partial array grammars</title><author>Sweety, F. ; Sasikala, K. ; Kalyani, T. ; Thomas, D. G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p2038-10398b33b016e2109d4691ce1f31c41c6a5a95af38a48632a23cc550db2a49643</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Arrays</topic><topic>Grammars</topic><topic>Languages</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sweety, F.</creatorcontrib><creatorcontrib>Sasikala, K.</creatorcontrib><creatorcontrib>Kalyani, T.</creatorcontrib><creatorcontrib>Thomas, D. G.</creatorcontrib><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sweety, F.</au><au>Sasikala, K.</au><au>Kalyani, T.</au><au>Thomas, D. G.</au><au>Behra, Harekrushna</au><au>Balaji, N</au><au>Gajendran, G</au><au>Govindarajan, A</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Partial array-rewriting P systems and basic puzzle partial array grammars</atitle><btitle>AIP conference proceedings</btitle><date>2020-11-06</date><risdate>2020</risdate><volume>2277</volume><issue>1</issue><issn>0094-243X</issn><eissn>1551-7616</eissn><coden>APCPCS</coden><abstract>In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages. We compare these grammars for generating powers. We have also generated partial array languages using extended and non extended partial array rewriting p-system. This is compared with basic puzzle partial array grammar.</abstract><cop>Melville</cop><pub>American Institute of Physics</pub><doi>10.1063/5.0027078</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0094-243X |
| ispartof | AIP conference proceedings, 2020, Vol.2277 (1) |
| issn | 0094-243X 1551-7616 |
| language | eng |
| recordid | cdi_proquest_journals_2458207294 |
| source | AIP Journals Complete |
| subjects | Arrays Grammars Languages |
| title | Partial array-rewriting P systems and basic puzzle partial array grammars |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T01%3A35%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_scita&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Partial%20array-rewriting%20P%20systems%20and%20basic%20puzzle%20partial%20array%20grammars&rft.btitle=AIP%20conference%20proceedings&rft.au=Sweety,%20F.&rft.date=2020-11-06&rft.volume=2277&rft.issue=1&rft.issn=0094-243X&rft.eissn=1551-7616&rft.coden=APCPCS&rft_id=info:doi/10.1063/5.0027078&rft_dat=%3Cproquest_scita%3E2458207294%3C/proquest_scita%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2458207294&rft_id=info:pmid/&rfr_iscdi=true |