{"entities":{"Q7361899":{"pageid":31521236,"ns":120,"title":"Item:Q7361899","lastrevid":105370100,"modified":"2026-10-07T13:38:47Z","type":"item","id":"Q7361899","labels":{"en":{"language":"en","value":"Tree Automata"}},"descriptions":{"en":{"language":"en","value":"AFP entry Tree-Automata"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"61c60822f12661cb6ad2953a6c9d458f7ca7d0f0","datavalue":{"value":"https://isa-afp.org/entries/Tree-Automata.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361899$EE69F34E-0BD3-458F-A646-C00876B5BAC6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"74360fd0e383eeb4108c100504aea295aab7ad39","datavalue":{"value":{"time":"+2009-11-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361899$74B30119-0177-4C10-A3CE-32D845274530","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"7545c5768cca6bd4b47e52bfec18c22cb81849df","datavalue":{"value":"Peter Lammich","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361899$E824E148-43E0-474B-AE6C-A8031608A97D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4d31796580d31a69e8728a08a22de914984db23c","datavalue":{"value":{"text":"Tree Automata","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361899$5942A597-E176-4C19-8C56-BAFE0C863C67","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7e688e61eb40e1f49980b7daad24cd92dc56f2b1","datavalue":{"value":"This work presents a machine-checked tree automata library for Standard-ML, OCaml and Haskell. The algorithms are efficient by using appropriate data structures like RB-trees. The available algorithms for non-deterministic automata include membership query, reduction, intersection, union, and emptiness check with computation of a witness for non-emptiness. The executable algorithms are derived from less-concrete, non-executable algorithms using data-refinement techniques. The concrete data structures are from the Isabelle Collections Framework. Moreover, this work contains a formalization of the class of tree-regular languages and its closure properties under set operations.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361899$70DE0BD8-F80F-4363-9726-094BB6DF02A9","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"34c82e9f6dc46a17a1531710a1314df285e95f1c","datavalue":{"value":{"entity-type":"item","numeric-id":5897502,"id":"Q5897502"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361899$BFF19BAB-E788-4515-97F8-75AD10AB84D0","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361899$9E9937EB-6177-4207-803B-DB340B6A3D5F","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"f0d6ccc9a00d2d1e3be7ec2239689671c14dec25","datavalue":{"value":{"entity-type":"item","numeric-id":7361918,"id":"Q7361918"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361899$185B0A36-8FE6-4EDC-B702-9F4129CE4037","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"73d93a21b0749f7f2c51d7daeb11b162660cd756","datavalue":{"value":{"entity-type":"item","numeric-id":7360784,"id":"Q7360784"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361899$8FA2CF3F-D80E-4D4F-B3A8-9366EB12298B","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361899$17F65B65-3379-429E-BB01-9FB8E649A497","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Tree Automata (AFP entry Tree-Automata)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Tree_Automata_(AFP_entry_Tree-Automata)"}}}}}