{"entities":{"Q1151756":{"pageid":1162505,"ns":120,"title":"Item:Q1151756","lastrevid":66971172,"modified":"2026-04-12T14:03:59Z","type":"item","id":"Q1151756","labels":{"en":{"language":"en","value":"A system of graph grammars which generates all recursively enumerable sets of labelled graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3718560"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1151756$938767D3-AE5F-4781-95F9-90814B967E2E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e84428f097239a252d2c248571e30f255e53c21d","datavalue":{"value":{"text":"A system of graph grammars which generates all recursively enumerable sets of labelled graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1151756$8F155D6A-7060-42F3-B67F-7DA3E821D6BF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0ccb28048db63e0db0577b392149bb11f26b3260","datavalue":{"value":"0458.68027","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$8265A0FB-3650-452D-BC31-599E2F24001E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1559e9988be3836a96d68b1fd21b319901e971d7","datavalue":{"value":{"entity-type":"item","numeric-id":1135289,"id":"Q1135289"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1151756$7A93DF8F-A11B-404B-9FFD-5847EFDDFF0D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"4644ee9c6c93e22a4aa2641411a372d7ea43bad8","datavalue":{"value":{"entity-type":"item","numeric-id":180651,"id":"Q180651"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1151756$8E2D29E6-CFA5-4894-B60B-62BDF7F42FD6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"23512e79b17ec0dbe00d89a570006ab4e1ecd403","datavalue":{"value":{"time":"+1978-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1151756$1F43B083-84FC-4A2C-9978-C8CA6362DBA9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$6721A980-BFBE-4580-A50E-21A451B38288","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$7CDA00CE-03F7-4410-B2D0-4AFD376862A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"18bdc3e9791879423538829d590ed2da8e1e9db6","datavalue":{"value":"03D25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$48E6C2E1-585A-47F7-AE4D-5E5307F339CA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fd88320aa55aa21c0c5d584eaa14a2bea0137143","datavalue":{"value":"3718560","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$B177D3E3-969A-402B-813D-59D37D398FAC","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bab6f80924c1487e7711052080473be2dd1544c9","datavalue":{"value":"complete system of graph grammars","type":"string"},"datatype":"string"},"type":"statement","id":"Q1151756$099DF9B3-0E1B-403A-AF9D-36BC34186E89","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1151756$9D57780B-E3BB-4200-B630-84CF72287C22","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"51e6ec5809ec9c6594dd51f31d1f7db6f8fe9aa7","datavalue":{"value":"https://doi.org/10.21099/tkbjm/1496158502","type":"string"},"datatype":"url"},"type":"statement","id":"Q1151756$4BAD97F3-C3BF-4B34-AA6B-C2976B57AB2A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"97fc65312d8bf6b91f1b1ad2dc4374f682c6fc55","datavalue":{"value":"W1905682100","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$6EA2F233-2D93-44FA-8875-55E921BE5103","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"608aad16433200c3f82b73456b3768161f3b5941","datavalue":{"value":"10.21099/TKBJM/1496158502","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1151756$6ADD0139-88EE-4905-8D3A-B1B343AD71E9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A system of graph grammars which generates all recursively enumerable sets of labelled graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_system_of_graph_grammars_which_generates_all_recursively_enumerable_sets_of_labelled_graphs"}}}}}