{"entities":{"Q4364597":{"pageid":6394196,"ns":120,"title":"Item:Q4364597","lastrevid":108299045,"modified":"2026-11-05T19:58:21Z","type":"item","id":"Q4364597","labels":{"en":{"language":"en","value":"An algorithm for identifying spliced languages"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1088281"}},"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":"Q4364597$27012CF3-A08E-42F1-BDD9-A68849E98550","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"743fcef12c24f0a087c294d6479fdeef2b1e4572","datavalue":{"value":"0889.92008","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$248EC486-01D0-43F5-8815-59FEAAB788CC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2c8ac2dd7e9a6ac8b1c666a65fae2b8a9cc6917d","datavalue":{"value":{"entity-type":"item","numeric-id":792090,"id":"Q792090"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4364597$F0331835-6297-4FF7-B6B0-D5A78350D28D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d0b577858cc7a896512e3b1dbe9886c719c2678f","datavalue":{"value":{"time":"+1998-06-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4364597$5A8ECACA-F16A-484C-BF31-A9C72EDD10B7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1cc6a2d1a81aec0cb5abdfe44055f934ac25329b","datavalue":{"value":"92C40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$FC83E92D-81B7-498D-9C0E-32F721CB580B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$7F68D230-0E30-4113-AF14-E57912357790","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d1f357130b885564de2a7f813fae2f00846119cd","datavalue":{"value":"92-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$3C799751-C09D-438E-8CEF-CC9D41D6C106","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"505a49771a29a1df80db47f27f0ca3c9ddd29e48","datavalue":{"value":"92D20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$9B9E983B-709A-4ADF-8244-898609070EB7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"870ac37649a415268f3efd206649a3e65f987199","datavalue":{"value":"1088281","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$DE2067CD-ED78-483F-A167-3101F55EA4FC","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"106028f0880e4e44fc65eff9fbb39f727b52390e","datavalue":{"value":"genetic splicing","type":"string"},"datatype":"string"},"type":"statement","id":"Q4364597$68EAB194-FC53-475C-A677-64118D01505D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"340762f3146ae228dad18cf369769c4d134f36c9","datavalue":{"value":"restriction enzyme","type":"string"},"datatype":"string"},"type":"statement","id":"Q4364597$E2A7297E-8C80-4CFE-9012-F8AB15928331","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e2c7aab0b2420b26b8cd9181307905fe146a80f2","datavalue":{"value":"DNA strings","type":"string"},"datatype":"string"},"type":"statement","id":"Q4364597$B61DF203-6D45-47EF-8069-AB2574380290","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c10bb9652038efe7c6ce05b7c158fde47e8de527","datavalue":{"value":"state transition graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q4364597$311D2C1C-E727-417D-AE7B-A8F7594602E0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"36cdcccdfcc6b313ffd420e82d594cc27db4468d","datavalue":{"value":"finite state automaton","type":"string"},"datatype":"string"},"type":"statement","id":"Q4364597$C5976A05-0C92-48EC-9EE4-0CA38C1E5A33","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":"Q4364597$6B21015D-ED1D-4956-9AE6-A35D603BBD79","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"19b4418f8d0f5713b76ff9b966dc42f8583d1f2f","datavalue":{"value":{"entity-type":"item","numeric-id":4016911,"id":"Q4016911"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"592ae796b84bffea80fa17c4c33d09f3c43bf6bb","datavalue":{"value":{"amount":"+0.8611077070236206","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q4364597$2CDA9086-ECC8-4A88-9A95-4DB74CF64218","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"566615aa3d85385c4d9ffca724a7c71c0981f734","datavalue":{"value":{"entity-type":"item","numeric-id":4376176,"id":"Q4376176"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4a49a53b4210223c61ffc4772d826d01440277be","datavalue":{"value":{"amount":"+0.8446924686431885","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q4364597$FEC5E75F-D3DA-4F77-9888-961B0973A74B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4a3adca514890d09f0dbac62670a3bece6423f40","datavalue":{"value":{"entity-type":"item","numeric-id":5717090,"id":"Q5717090"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"36c5516255705530d99acc200e26ff8be1ddce41","datavalue":{"value":{"amount":"+0.8078702688217163","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q4364597$D1B45F7E-6030-4BCD-BFCF-D7BD8706F7C5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5cc4b1cf509f7aac7b4c9da15c1c6f9d0283240c","datavalue":{"value":{"text":"An algorithm for identifying spliced languages","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4364597$CA4FA2F9-B492-4B81-9680-AB7D71EB87E2","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7dae7182ce8fde0ed39a26a8a4c6f22ea3b39e18","datavalue":{"value":"10.1007/BFB0045107","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4364597$2C739DBC-915A-4BB8-BF08-2F7BE01BAC1B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"12b6dba88169f2076c585273dc82e1232bf0a576","datavalue":{"value":"Genetic splicing is an abstraction of the genetic engineering which involves restriction enzymes and DNA molecules represented by strings over an alphabet of four pairing symbols \\(A/T\\), \\(C/G\\), \\(G/C\\) and \\(T/A\\). The effect of a restriction enzyme is to cleave a DNA molecule into two pieces at a specific pattern which is defined by the enzyme. Two cleaved DNA strings can be recombined and form a new string if they have matching cleaved ends. To abstract this process, let each of the pairing symbols be represented by a single symbol in an alphabet \\(A\\). An enzyme \\(s\\in A^+\\) can be viewed as consisting of three substrings, i.e., \\(s=ux v\\), \\(u,x,v\\in A^*\\), such that a DNA string \\(w\\) is cut at its substring \\(x\\), so called crossing, if it has a matching substring \\(uxv\\). If there are two DNA strings \\(w_0uxvz_0\\) and \\(w_1u'xv' z_1\\), and two enzymes \\(uxv\\) and \\(u'xv'\\) which have identical crossing \\(x\\), the two DNA strings are cleaved and recombined (i.e., spliced) at \\(x\\) producing new strings \\(w_0uxv'z_1\\) and \\(w_1u'xv \\). We can abstract this process in terms of a language generating system of two sets of strings, one for DNA strings and the other for enzymes. The paper presents an algorithm for the problem of deciding whether or not a language \\(L\\), given in terms of the state transition graph of the reduced finite state automaton whose language is \\(L\\), can be generated by a splicing system with a finite initial set of strings using a given enzyme set \\(X\\). The algorithm is based on the properties of cycles of the state transition graph that should be satisfied if the language can be spliced with a finite initial set of strings. For the entire collection see [Zbl 0869.00027].","type":"string"},"datatype":"string"},"type":"statement","id":"Q4364597$CA464A07-D426-4DBA-8247-2985DB7CE3F8","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4364597$9E8C267B-4181-48E0-88BA-37FEE0B31919","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for identifying spliced languages","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_identifying_spliced_languages"}}}}}