{"entities":{"Q7361722":{"pageid":31520705,"ns":120,"title":"Item:Q7361722","lastrevid":105368366,"modified":"2026-10-07T13:37:28Z","type":"item","id":"Q7361722","labels":{"en":{"language":"en","value":"Functional Automata"}},"descriptions":{"en":{"language":"en","value":"AFP entry Functional-Automata"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"723cae5736a42896cbf202b821144732a53e8448","datavalue":{"value":"https://isa-afp.org/entries/Functional-Automata.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361722$C1A7327F-942E-4DC3-9EFF-8A651BCC416F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0c6fdb76f2daf9edf730ebf5f5bb24859da4eb5e","datavalue":{"value":{"time":"+2004-03-30T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361722$08F9F706-1AAE-49A3-B8CB-CBFF278319D0","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"78083bbf5b06a4f292e9e00ee445948e4fa51db5","datavalue":{"value":"Tobias Nipkow","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361722$E82FA3ED-5745-440C-9FF8-10EDBFAC3201","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8fd2d0e630ad477cbaf7657d3890d30d5817ba8a","datavalue":{"value":{"text":"Functional Automata","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361722$DB6EC462-60EC-4BAB-9DB9-E681A5ACA26A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8352d7fd9604257bb0a3333cc7b27da0a7e6e288","datavalue":{"value":"This theory defines deterministic and nondeterministic automata in a functional representation: the transition function/relation and the finality predicate are just functions. Hence the state space may be infinite. It is shown how to convert regular expressions into such automata. A scanner (generator) is implemented with the help of functional automata: the scanner chops the input up into longest recognized substrings. Finally we also show how to convert a certain subclass of functional automata (essentially the finite deterministic ones) into regular sets.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361722$EF4F400D-AF36-4690-98EC-7500FE4EA241","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":"Q7361722$7217A39F-F9FD-490A-9309-72B0718FCC1B","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"a0e462408f240420e2b3f4dd5e025dcac9e4a9cd","datavalue":{"value":{"entity-type":"item","numeric-id":7361044,"id":"Q7361044"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361722$9B790016-C8BE-4DA2-9593-21DB596EC604","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":"Q7361722$41921BB5-F526-4C36-8357-5E964E72D50A","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":"Q7361722$5CDF93F0-08A2-4BEE-AB06-C1D19191655B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Functional Automata","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Functional_Automata"}}}}}