{"entities":{"Q1219247":{"pageid":1229996,"ns":120,"title":"Item:Q1219247","lastrevid":66913290,"modified":"2026-04-12T13:41:50Z","type":"item","id":"Q1219247","labels":{"en":{"language":"en","value":"Iterative decomposition of finite probabilistic automata"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3485659"}},"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":"Q1219247$4C0EA5B0-359F-41FD-B75D-E7B5E96954A7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"197a68d388728761eeafc4f6e46ec11b2e355110","datavalue":{"value":{"text":"Iterative decomposition of finite probabilistic automata","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1219247$ACFE7F33-7238-42DE-998A-E8C7CF1DE441","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"75ba16a87bde95552ae3f6cef86483f265e3951c","datavalue":{"value":"0309.94062","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1219247$7434742F-4D0D-46A5-9A32-7F1A4FF68F45","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"68e705f1118ac325d675077e08736aa1327d4c03","datavalue":{"value":{"entity-type":"item","numeric-id":1219245,"id":"Q1219245"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1219247$8ACC769E-016E-402B-A160-74FE42830F95","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"39f980e0045217f3fa36b97470b3e1fe6f4c33ae","datavalue":{"value":{"entity-type":"item","numeric-id":1219246,"id":"Q1219246"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1219247$718203F3-E82A-4668-B528-84B5E42439ED","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1219247$0D9B3E17-369B-411B-AB26-D05E92D4A454","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"718868df62fa29cb04609217d34e1254e53a40d9","datavalue":{"value":{"time":"+1974-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":"Q1219247$5224CF31-CB03-4BE6-ACF7-9F31BC3DA83D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1219247$070AE6E1-2758-4880-8104-AC456940FB58","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"33330f318f0ed320fb58e1d07df1b29e4f59eacb","datavalue":{"value":"3485659","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1219247$8AFE1F63-01FC-4093-9630-51D79978E405","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":"Q1219247$ED0BC3E1-305E-4113-8BBC-5F084CF420C0","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Iterative decomposition of finite probabilistic automata","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Iterative_decomposition_of_finite_probabilistic_automata"}}}}}