A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 188 |
|---|---|
| container_issue | |
| container_start_page | 177 |
| container_title | |
| container_volume | |
| creator | Ljunglöf, Peter |
| description | It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time. |
| doi_str_mv | 10.1007/11422532_12 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16895932</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16895932</sourcerecordid><originalsourceid>FETCH-LOGICAL-j285t-d1e9b0b434f11c0d523ac032ab9c7a3a955d05f18940bd58d0dae116cfc66e213</originalsourceid><addsrcrecordid>eNpNkD9PwzAUxM0_iVA68QW8MDAE3vOLk3isqrYgFdGhzJHjOCjFias4SO23J1UZuOWG--l0OsYeEJ4RIHtBTISQJAoUF-yOZAKEShJcsghTxJgoUVdsqrL8lAk5enbNIiAQscoSumXTEHYwijDPMI3YYsY33h073zba8W3TWr44DLYLje-4r_lG99o56_j7jxuavbN87rvBHoZ42VvLV71uW93fs5tau2Cnfz5hn8vFdv4arz9Wb_PZOt6JXA5xhVaVUCaU1IgGKilIGyChS2UyTVpJWYGsMVcJlJXMK6i0RUxNbdLUCqQJezz37nUw2tW97kwTin3fjCOOBaa5korEyD2duTBG3Zfti9L771AgFKcfi38_0i866V6o</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Polynomial Time Extension of Parallel Multiple Context-Free Grammar</title><source>Springer Books</source><creator>Ljunglöf, Peter</creator><contributor>Moot, Richard ; Stabler, Edward ; Blache, Philippe ; Busquets, Joan</contributor><creatorcontrib>Ljunglöf, Peter ; Moot, Richard ; Stabler, Edward ; Blache, Philippe ; Busquets, Joan</creatorcontrib><description>It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540257837</identifier><identifier>ISBN: 3540257837</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319530</identifier><identifier>EISBN: 9783540319535</identifier><identifier>DOI: 10.1007/11422532_12</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Concrete Syntax ; Exact sciences and technology ; Grammar Formalism ; Input String ; Intersection Operation ; Linearization Type ; Speech and sound recognition and synthesis. Linguistics</subject><ispartof>Lecture notes in computer science, 2005, p.177-188</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11422532_12$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11422532_12$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16895932$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Moot, Richard</contributor><contributor>Stabler, Edward</contributor><contributor>Blache, Philippe</contributor><contributor>Busquets, Joan</contributor><creatorcontrib>Ljunglöf, Peter</creatorcontrib><title>A Polynomial Time Extension of Parallel Multiple Context-Free Grammar</title><title>Lecture notes in computer science</title><description>It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Concrete Syntax</subject><subject>Exact sciences and technology</subject><subject>Grammar Formalism</subject><subject>Input String</subject><subject>Intersection Operation</subject><subject>Linearization Type</subject><subject>Speech and sound recognition and synthesis. Linguistics</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540257837</isbn><isbn>3540257837</isbn><isbn>3540319530</isbn><isbn>9783540319535</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkD9PwzAUxM0_iVA68QW8MDAE3vOLk3isqrYgFdGhzJHjOCjFias4SO23J1UZuOWG--l0OsYeEJ4RIHtBTISQJAoUF-yOZAKEShJcsghTxJgoUVdsqrL8lAk5enbNIiAQscoSumXTEHYwijDPMI3YYsY33h073zba8W3TWr44DLYLje-4r_lG99o56_j7jxuavbN87rvBHoZ42VvLV71uW93fs5tau2Cnfz5hn8vFdv4arz9Wb_PZOt6JXA5xhVaVUCaU1IgGKilIGyChS2UyTVpJWYGsMVcJlJXMK6i0RUxNbdLUCqQJezz37nUw2tW97kwTin3fjCOOBaa5korEyD2duTBG3Zfti9L771AgFKcfi38_0i866V6o</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Ljunglöf, Peter</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>A Polynomial Time Extension of Parallel Multiple Context-Free Grammar</title><author>Ljunglöf, Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j285t-d1e9b0b434f11c0d523ac032ab9c7a3a955d05f18940bd58d0dae116cfc66e213</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Concrete Syntax</topic><topic>Exact sciences and technology</topic><topic>Grammar Formalism</topic><topic>Input String</topic><topic>Intersection Operation</topic><topic>Linearization Type</topic><topic>Speech and sound recognition and synthesis. Linguistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ljunglöf, Peter</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ljunglöf, Peter</au><au>Moot, Richard</au><au>Stabler, Edward</au><au>Blache, Philippe</au><au>Busquets, Joan</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Polynomial Time Extension of Parallel Multiple Context-Free Grammar</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>177</spage><epage>188</epage><pages>177-188</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540257837</isbn><isbn>3540257837</isbn><eisbn>3540319530</eisbn><eisbn>9783540319535</eisbn><abstract>It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11422532_12</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.177-188 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16895932 |
| source | Springer Books |
| subjects | Applied sciences Artificial intelligence Computer science control theory systems Concrete Syntax Exact sciences and technology Grammar Formalism Input String Intersection Operation Linearization Type Speech and sound recognition and synthesis. Linguistics |
| title | A Polynomial Time Extension of Parallel Multiple Context-Free Grammar |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T23%3A09%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Polynomial%20Time%20Extension%20of%20Parallel%20Multiple%20Context-Free%20Grammar&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Ljungl%C3%B6f,%20Peter&rft.date=2005&rft.spage=177&rft.epage=188&rft.pages=177-188&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540257837&rft.isbn_list=3540257837&rft_id=info:doi/10.1007/11422532_12&rft_dat=%3Cpascalfrancis_sprin%3E16895932%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319530&rft.eisbn_list=9783540319535&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |