{ "labelLang" : "hun", "responseDate" : "2024-03-29 13:05", "content" : { "otype" : "Citation", "mtid" : 26229181, "status" : "VALIDATED", "published" : true, "unhandledTickets" : 0, "oldTimestamp" : "2017-02-15T17:40:54.000+0000", "deleted" : false, "oldId" : 16229181, "lastRefresh" : "2023-09-18T23:09:59.294+0000", "lastModified" : "2019-02-14T12:50:01.469+0000", "created" : "2016-11-29T23:35:14.000+0000", "lastDuplumOK" : "2021-02-24T11:33:23.194+0000", "lastDuplumSearch" : "2021-02-24T11:33:23.194+0000", "adminApproved" : "2017-02-15T17:40:54.000+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10015181, "link" : "/api/admin/10015181", "label" : "Nagy Eszter (SZTA admi, admin)", "familyName" : "Nagy", "givenName" : "Eszter", "published" : true, "oldId" : 10015181, "snippet" : true }, "validated" : "2019-02-14T12:50:04.607+0000", "validator" : { "otype" : "Admin", "mtid" : 521, "link" : "/api/admin/521", "label" : "Szuper Admin (admin)", "familyName" : "Szuper", "givenName" : "Admin", "published" : true, "snippet" : true }, "publication" : { "otype" : "JournalArticle", "mtid" : 162166, "link" : "/api/publication/162166", "label" : "Csuhaj-Varjú E et al. On the computational completeness of context-free parallel communicating grammar systems. (1999) THEORETICAL COMPUTER SCIENCE 0304-3975 1879-2294 215 1-2 349-358", "core" : true, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "On the computational completeness of context-free parallel communicating grammar systems", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 75341, "link" : "/api/publicationidentifier/75341", "label" : "DOI: 10.1016/S0304-3975(98)00193-5", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "oaFree" : false, "validState" : "NO", "idValue" : "10.1016/S0304-3975(98)00193-5", "realUrl" : "https://doi.org/10.1016/S0304-3975%2898%2900193-5", "published" : false, "oldId" : 33415, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 75340, "link" : "/api/publicationidentifier/75340", "label" : "WoS: 000078824600021", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "000078824600021", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000078824600021", "published" : false, "oldId" : 33416, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 16843445, "link" : "/api/publicationidentifier/16843445", "label" : "Scopus: 0346304138", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "0346304138", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-0346304138", "published" : true, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 4260, "link" : "/api/journal/4260", "label" : "THEORETICAL COMPUTER SCIENCE 0304-3975 1879-2294", "pIssn" : "0304-3975", "eIssn" : "1879-2294", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 4260, "snippet" : true }, "volume" : "215", "issue" : "1-2", "publishedAt" : [ ], "pageLength" : 10, "publishedYear" : 1999, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : false, "published" : true, "oldId" : 162166, "snippet" : true }, "publicationMtid" : 162166, "related" : { "otype" : "JournalArticle", "mtid" : 27101358, "link" : "/api/publication/27101358", "label" : "Bruda Stefan D. et al. Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space. (2016) PARALLEL PROCESSING LETTERS (PPL) 0129-6264 1793-642X 26 3", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 11817677, "link" : "/api/publicationidentifier/11817677", "label" : "DOI: 10.1142/SO129626416500122", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "10.1142/SO129626416500122", "realUrl" : "https://doi.org/10.1142/SO129626416500122", "published" : false, "oldId" : 13802858, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 11817676, "link" : "/api/publicationidentifier/11817676", "label" : "WoS: 000384457100003", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "000384457100003", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000384457100003", "published" : false, "oldId" : 13802857, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 13462297, "link" : "/api/publicationidentifier/13462297", "label" : "Scopus: 84988637916", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "NO", "idValue" : "84988637916", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84988637916", "published" : false, "oldId" : 16403126, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 10009389, "link" : "/api/journal/10009389", "label" : "PARALLEL PROCESSING LETTERS (PPL) 0129-6264 1793-642X", "pIssn" : "0129-6264", "eIssn" : "1793-642X", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "hungarian" : false, "published" : true, "oldId" : 10009389, "snippet" : true }, "volume" : "26", "issue" : "3", "publishedAt" : [ ], "publishedYear" : 2016, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : false, "published" : true, "oldId" : 17101358, "snippet" : true }, "relatedMtid" : 27101358, "source" : "WoS-XML", "externalCitation" : true, "externalCitationOK" : true, "mentionCount" : 1, "link" : "/api/citation/26229181", "label" : "Bruda Stefan D. et al. Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space. (2016) PARALLEL PROCESSING LETTERS (PPL) 0129-6264 1793-642X 26 3", "template" : "