{"entities":{"Q7361603":{"pageid":31520348,"ns":120,"title":"Item:Q7361603","lastrevid":105367649,"modified":"2026-10-07T13:37:15Z","type":"item","id":"Q7361603","labels":{"en":{"language":"en","value":"Parikh's Theorem"}},"descriptions":{"en":{"language":"en","value":"AFP entry Parikh"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2dc74470e3dc1ef362de97afc5b3cc4f6d92cc4d","datavalue":{"value":"https://isa-afp.org/entries/Parikh.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361603$9F176E04-B995-46E1-A1DE-6403BD861BC0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ccf6047abb150911ac4decc7c0ffa4e59e6e1fec","datavalue":{"value":{"time":"+2025-06-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361603$79698FE7-5395-4A11-B848-A48EF76AE661","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"11997766b2ebf12d76e5ab24cdce52938b0ffabf","datavalue":{"value":"Fabian Lehr","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361603$E2686D7A-F7FC-423B-95F8-B6F8B2FEB193","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4f232dfde23d87f78f2eae948b5a1c7fbb1b3289","datavalue":{"value":{"text":"Parikh's Theorem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361603$D53A48EF-AC44-43A7-B09E-88C1C63C3DCB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"222cc0981cfed1b80f531e1f8d6b8e5c5be36857","datavalue":{"value":"In formal language theory, the Parikh image of a language $L$ is the set of multisets of the words in $L$: the order of letters in a word becomes irrelevant, only the number of occurrences is relevant. Parikh's Theorem states that the Parikh image of a context-free language is the same as the Parikh image of some regular language. This formalization closely follows Pilling's proof: It describes a context-free language as a minimal solution to a system of equations induced by a context free grammar for this language. Then it is shown that there exists a minimal solution to this system which is regular, such that the regular solution and the context-free language have the same Parikh image.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361603$CB2E6D99-181C-4E36-8444-3C975594A4D3","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"165bcf3596e5640fb621736d24b294dd1c0e618f","datavalue":{"value":{"entity-type":"item","numeric-id":4403744,"id":"Q4403744"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361603$6F5B40E8-C4FD-4CFC-8149-A492A77239DE","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":"Q7361603$58B5817B-1754-4CC9-9199-B30A261757BD","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"ceffd3d57cea2a1ab975648b77a2e7bb64023a47","datavalue":{"value":{"entity-type":"item","numeric-id":7361147,"id":"Q7361147"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361603$0D956532-9F75-4482-A2E5-9CC517FDC46C","rank":"normal"},{"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":"Q7361603$5EED1917-4995-4BE3-ADF3-22F6E546C1A7","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":"Q7361603$5AB21065-03FE-4EDA-9871-D84B4A6BF8A1","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":"Q7361603$435EEED9-95AE-41AE-8588-2470B1C49602","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parikh's Theorem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Parikh%27s_Theorem"}}}}}