{"entities":{"Q6946849":{"pageid":21184671,"ns":120,"title":"Item:Q6946849","lastrevid":75973599,"modified":"2026-04-22T09:04:17Z","type":"item","id":"Q6946849","labels":{"en":{"language":"en","value":"Equivalence of deterministic top-down tree-to-string transducers is decidable"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8076139"}},"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":"Q6946849$51FA589B-7689-4156-9F20-2CBA41C51166","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0b48e545f1f6e87946f2c324c0399e4bb4218f32","datavalue":{"value":{"text":"Equivalence of deterministic top-down tree-to-string transducers is decidable","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6946849$2D683A60-4D2E-43BA-AFEF-60C8DBF09594","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d32cf33c33458f6e4c94f382bef8194dc3b25b1a","datavalue":{"value":"10.1109/FOCS.2015.62","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946849$D15D3E13-CA19-4397-B104-FC3D3DF298EB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b2c3f07bd4567f73e6d9c4e2b60def57e979538e","datavalue":{"value":{"entity-type":"item","numeric-id":269347,"id":"Q269347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946849$04C699C1-5BFB-4D48-A54B-C7C6A884C831","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0d8846866e0f2e2874e781dfcefe3a000615efed","datavalue":{"value":{"entity-type":"item","numeric-id":435967,"id":"Q435967"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946849$2FDE045F-AE4C-4572-8F58-24E585888FB0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c10ab29fa515011a8cd8477c4553b253249bf95b","datavalue":{"value":{"entity-type":"item","numeric-id":167099,"id":"Q167099"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946849$A1B24D8C-4734-4893-98D5-C6E17974DE36","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"edc92756de24fbad63d3f53ad7f8ea4e3721e7de","datavalue":{"value":{"time":"+2025-08-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6946849$B2325DF1-F6D5-47AA-8A90-7FFA1FDA3E8B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a8071a5322d22965b272dc3b6fde5fa90faa63e6","datavalue":{"value":"https://www.pure.ed.ac.uk/ws/files/21912254/Seidl_et_al_2015Equivalence_of_Deterministic.pdf","type":"string"},"datatype":"url"},"type":"statement","id":"Q6946849$3DCE5558-A071-4ABF-87CA-DBCF50D750A9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946849$EA6CF29D-A4B4-409D-9C26-727327A1BE46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946849$3F453446-3B04-41EA-815C-5418D61E7E4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946849$D7985F00-6294-4FC2-A27A-11406C199994","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"341c6af37025f061b5c4a20f626db3663b8401a6","datavalue":{"value":"8076139","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946849$68E2CEE9-22F5-4AA9-86AF-9BECBB73A0A5","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":"Q6946849$772429CC-D4EF-4B07-99DC-751901F8CF2F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Equivalence of deterministic top-down tree-to-string transducers is decidable","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Equivalence_of_deterministic_top-down_tree-to-string_transducers_is_decidable"}}}}}