{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #2a28a06c","location_key":"b40e59066bdfae2ccb4c0e3067519a7c844f3e81c366445092edf08ebaf71d5f","pair_key":"bfcc9380737c5b06fc7868529f28abed5dfa40b8f9828c27c4a68b18fe63eb92","passage_key":"01b4a7119639dd042b8c0101acba5c9f06da93ad4cb4cf7d8f7e16b1f2e89aea","prominence":"central","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #2a28a06c","kind":"definition","note":"Mathlib bundles a state type, a transition taking a state and a symbol to a single state, one start state and a set of accepting states; because the transition is a total function into the state type, determinism and symbol-consuming steps both hold by construction, while the state type may be any type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":65,"library":"mathlib","line":59,"path":"Mathlib/Computability/DFA.lean","proof_status":"definition"}},"location":{"declaration":"DFA","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[216,367],"span_sha256":"0976d6e95aadd9dfd7dd0e5a6e3ab0f47e33a60c937fbf93bf07083c92cda3f2"}},"location":{"quote":{"exact":"each of its transitions is uniquely determined by its source state and"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #7c3d2169","location_key":"07ee59030fac54a127f951467b9ecb3cdbfef232b1f49583ad8dccb53e45732d","pair_key":"1d4d8485537f2618d9bebd7dd862aa74dcd08138924ec75c39b0d6c425a019c7","passage_key":"944ba1cf10ee4859d356cb9c574f28b7b2e33979cbfc3381cac675af62bdc386","prominence":"subject","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #7c3d2169","kind":"definition","note":"The structure's docstring says the state type may be infinite and that a step labelled by the empty option reads no symbol; those are exactly the two freedoms the article grants over a deterministic machine.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":48,"library":"mathlib","line":40,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[368,494],"span_sha256":"57a498a08db3e9fa05d38f751d4f9ca3449dd260bf7e38e26f0f1e444fcdceb5"}},"identifiers":{"wikidata":"Q617295"},"location":{"quote":{"exact":"A nondeterministic finite automaton (NFA), or nondeterministic finite-state machine, does not need"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #7c3d2169","location_key":"4844354565b1d9f51340b90b4a5dabee544c65eae7c6aec5abfb9b79d840efee","pair_key":"c0763476f9375e8959ee0e89c2b17da965d6e8e5ba4fe5c8b60e273e7254d708","passage_key":"944ba1cf10ee4859d356cb9c574f28b7b2e33979cbfc3381cac675af62bdc386","prominence":"subject","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #7c3d2169","kind":"definition","note":"Mathlib keeps symbol-free steps in a separate structure, so this one covers the article's machines whose every transition consumes a symbol, with the state type unconstrained.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":61,"library":"mathlib","line":55,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[368,494],"span_sha256":"57a498a08db3e9fa05d38f751d4f9ca3449dd260bf7e38e26f0f1e444fcdceb5"}},"identifiers":{"wikidata":"Q617295"},"location":{"quote":{"exact":"A nondeterministic finite automaton (NFA), or nondeterministic finite-state machine, does not need"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #143b801f","location_key":"231389233d4ff53f567e39e29d97f5cbc175a84296156b3f2ede2c0f39f25e73","pair_key":"15a7f93bcf04ca245c7481f41028f716571d034ae7255c15db16de26e8d06d7a","passage_key":"f0ce3c925799dd6f0599e7f87bafe078668a08ee8e6c8d8f0207c891e1bf5899","prominence":"central","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #143b801f","kind":"theorem","note":"Mathlib keeps the two kinds of machine as separate structures and writes the inclusion as a construction that keeps the start and accepting states and makes each step a one-element set, together with this equality of accepted languages; the state type is arbitrary.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":354,"library":"mathlib","line":348,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.toNFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[495,535],"span_sha256":"3eded5fa116e82662767e236f4100bcf8ece4adc28545a0a4132a4beabe68f7c"}},"location":{"quote":{"exact":"In particular, every DFA is also an NFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #143b801f","location_key":"005819f35953b8ab0bf2db630882752409d1fdb9c2eb23828dfb2cc25faf4508","pair_key":"060e1d82514af549c185b597338afa8d28182cf35f381bc548558600e9841921","passage_key":"f0ce3c925799dd6f0599e7f87bafe078668a08ee8e6c8d8f0207c891e1bf5899","prominence":"central","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #143b801f","kind":"theorem","note":"The construction that reads a deterministic machine as a nondeterministic one, with singleton step sets; by itself it carries no claim about the words accepted.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":334,"library":"mathlib","line":331,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"DFA.toNFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[495,535],"span_sha256":"3eded5fa116e82662767e236f4100bcf8ece4adc28545a0a4132a4beabe68f7c"}},"location":{"quote":{"exact":"In particular, every DFA is also an NFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #cb6cd51a","location_key":"558f17435434ab9b9b61adfc81387df3725de5de5768982844eeb58fb4cb9ddb","pair_key":"4c316308015dc8bf08873e188291482e4f1357ef1a9ab1a90d92fd7cbd65e0a4","passage_key":"89722902a65d851ddc8e00c6b0dd0f44004b19763af48509a386217c05d74578","prominence":"central","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #cb6cd51a","kind":"theorem","note":"The deterministic machine here is the one whose states are sets of the original states, built by the construction the article names, and the theorem equates the two accepted languages for every state type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[652,794],"span_sha256":"e12fe35887ff608ca7a285578e3b134cf6688a30795eecb7b2e52eead17efcfa"}},"location":{"quote":{"exact":"Using the subset construction algorithm, each NFA can be translated to an"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #cb6cd51a","location_key":"2c0f9d0e182701d3844061fb35fa813ae5e2fb12b34b14436010e9b06db691b6","pair_key":"9077c33c483d4de51d48ec85e3ac117e721d17216f3d988d85a020e6dde55413","passage_key":"89722902a65d851ddc8e00c6b0dd0f44004b19763af48509a386217c05d74578","prominence":"central","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #cb6cd51a","kind":"theorem","note":"The construction itself, whose states are sets of the original states and whose step is the one-symbol image of a set of states; on its own it says nothing about accepted words.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":309,"library":"mathlib","line":306,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.toDFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[652,794],"span_sha256":"e12fe35887ff608ca7a285578e3b134cf6688a30795eecb7b2e52eead17efcfa"}},"location":{"quote":{"exact":"Using the subset construction algorithm, each NFA can be translated to an"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #a32da92c","location_key":"2522f4a452d5448d21087bbfa676531449acff7c9351bd571a812188598d0aaa","pair_key":"9e7ef2bd906b41cae451b4b20d13f92c253b3c5c40599a566b514f790f8f2481","passage_key":"497a7e4f7fed896690c90c26fd30d9fd95ef3a26bf765dd86183c06b818035dd","prominence":"central","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a32da92c","kind":"theorem","note":"Mathlib fixes regularity by the existence of a finite deterministic machine, so this equivalence delivers the article's conclusion exactly for the deterministic automata among its machines; the nondeterministic ones are not reached by it alone.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":374,"library":"mathlib","line":372,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"Language.isRegular_iff","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[795,844],"span_sha256":"d4f0187581cbdad111b1d3d4a97120cd365361a31adce79f0395d77e6a5d9f08"}},"location":{"quote":{"exact":"Like DFAs, NFAs only recognize regular languages."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #a32da92c","location_key":"c518b1eb0919a72f8f82ebbbb4e4083b3562de39af4a753be1b88866efb5986d","pair_key":"63e30b6a7a7e7cc29b961798d8369d3106e658a85c61a8131673c2342db76e14","passage_key":"497a7e4f7fed896690c90c26fd30d9fd95ef3a26bf765dd86183c06b818035dd","prominence":"central","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a32da92c","kind":"theorem","note":"It equates the language of a nondeterministic machine with that of its determinisation; reaching regularity needs in addition that sets over a finite state set form a finite type and Mathlib's characterisation of regular languages.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[795,844],"span_sha256":"d4f0187581cbdad111b1d3d4a97120cd365361a31adce79f0395d77e6a5d9f08"}},"location":{"quote":{"exact":"Like DFAs, NFAs only recognize regular languages."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #d37a78fd","passage_key":"10aeacdb66ee5f43b7f7913794677ab6fa2bb1c7bf4733cc4659965103e11027","prominence":"supporting","receipt":{"candidates":4,"queries":4,"sha256":"8dd58405e51cfb9919456ca2a8b2d7e289eb447fdf67d6093551673b433d2315"},"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #d37a78fd","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[1159,1307],"span_sha256":"9b6786e4a6ea219d7fd858d2ef951c7d99ebc3761d083925c42d641370da16aa"}},"location":{"quote":{"exact":"Conversely, Kleene's algorithm can be used to convert an NFA into a"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #1f803bcb","location_key":"552c52534a46b8edaaec38014fb9167eee2709fc234ba3738ff464a7e4ff2d87","pair_key":"f9ba6cbb2d43758ff9ec9bcb4f14947ea1f4b3eb0cd8a292c428b197b01c168d","passage_key":"b98158ba995c23cde3ea4b40a9140336a52f4b7ec66f0fd2173992a102680827","prominence":"central","rank":1,"section":["Informal introduction"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #1f803bcb","kind":"definition","note":"A run in Mathlib is an inductive path labelled by the word, so a path from a start state to an accepting state is one sequence of applicable transitions that consumes the whole word; the state type is left arbitrary.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2008,2163],"span_sha256":"2b3c778798d666e71c7183f677b4404b4fe409ed00cf8455b3a4d41772376de4"}},"location":{"quote":{"exact":"If there exists at least one \"lucky run\", i.e. some sequence of"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #1f803bcb","location_key":"e186a1d48bce9e61e08a860d40f0508e7d95f9a0dea4c5c68933e69b2df7a246","pair_key":"a1c8a7b5ac08b1072ea957590d532246927342c49added77b5e8513328eaa01f","passage_key":"b98158ba995c23cde3ea4b40a9140336a52f4b7ec66f0fd2173992a102680827","prominence":"central","rank":2,"section":["Informal introduction"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #1f803bcb","kind":"definition","note":"This is the object the article's sentence defines: the language of words leading the machine, under some choice of transitions, into an accepting state; Mathlib states it for any state type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":253,"library":"mathlib","line":253,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2008,2163],"span_sha256":"2b3c778798d666e71c7183f677b4404b4fe409ed00cf8455b3a4d41772376de4"}},"location":{"quote":{"exact":"If there exists at least one \"lucky run\", i.e. some sequence of"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #13ed5544","location_key":"80a4bf35d156fb6fc96fd1fd36b5b7c1ff55967b97120270d6fab4d4e59ee840","pair_key":"b48003ed3f05db3d549737a7c142020a89a351afac0881aac60e002809dc9c7a","passage_key":"88b212e34af7a4ac477a155df426b6f5aa31cf347937b7470f836a90f024eb8b","prominence":"supporting","rank":1,"section":["Informal introduction"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #13ed5544","kind":"definition","note":"Mathlib has no separate name for a refused input: it is simply a word outside the accepted language, and this equivalence read negatively is the article's condition that no choice sequence works.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2164,2292],"span_sha256":"61c03918206aee6e08f2d1aac5fada24683c180db427ed12e8c671b621e73437"}},"location":{"quote":{"exact":"Otherwise, i.e. if no choice sequence at all can consume all the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #13ed5544","location_key":"ca639a37f435629adadc03f82df0a79412ea6bbe3e99da88e230dde2fc1287a6","pair_key":"f8589b1552074900bf7fc1f89cd5c23e4ecbc879df6ca997787e51acd13bd456","passage_key":"88b212e34af7a4ac477a155df426b6f5aa31cf347937b7470f836a90f024eb8b","prominence":"supporting","rank":2,"section":["Informal introduction"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #13ed5544","kind":"definition","note":"The same criterion through step-by-step evaluation: the set of states reachable after the whole word meets the accepting states, whose failure is the article's refusal of the input.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2164,2292],"span_sha256":"61c03918206aee6e08f2d1aac5fada24683c180db427ed12e8c671b621e73437"}},"location":{"quote":{"exact":"Otherwise, i.e. if no choice sequence at all can consume all the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #f9692420","location_key":"11c97cb253d43d62c7bb130cef31a3aba2e4a0a347161390c79e848b95a6be36","pair_key":"247d36f6476f06be31e14fca357bf3d70ebfb9affa9ff820ad57cd6d19e0c4e7","passage_key":"8509b69200e474cf5634e03d4f33cb7760d987afada3b123d4e4b201133413ad","prominence":"supporting","rank":1,"section":["Informal introduction"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #f9692420","kind":"definition","note":"Mathlib's set of states reached after the input is the collection of copies still alive in the cloning picture, and the lemma is stated for machines with a whole set of start states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2622,2747],"span_sha256":"1e1a96cc37215364a5546c05782e2a95401ddbe2428f2168c026f669b254e6b4"}},"location":{"quote":{"exact":"If, after consuming the complete input, any of the copies is in"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #f9692420","location_key":"feec548378f023b27d7463d1a3b4c18568e340459c4dd165d2e54d60bc2c1e39","pair_key":"072524b8d139443752b665feb287ba73fe9b06773826e4aa79892937c540f940","passage_key":"8509b69200e474cf5634e03d4f33cb7760d987afada3b123d4e4b201133413ad","prominence":"supporting","rank":2,"section":["Informal introduction"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #f9692420","kind":"definition","note":"This is the defined object: the language whose members are the inputs with an accepting state among those reached, over arbitrary state and letter types.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":253,"library":"mathlib","line":253,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2622,2747],"span_sha256":"1e1a96cc37215364a5546c05782e2a95401ddbe2428f2168c026f669b254e6b4"}},"location":{"quote":{"exact":"If, after consuming the complete input, any of the copies is in"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #a34ed415","location_key":"ca57f84f93962ae627bef442ac29b4dfcfa52fcf85b0e579d3a51d83539bea17","pair_key":"5b276120706bcff4956031e2f506365bee13e7b9e373a42662b06bc57d3c41ff","passage_key":"9b624c6ce3141c437e7d4a156b9b0c55672af6a0c4ff6436a14fdbeeb6c0f55b","prominence":"central","rank":1,"section":["Formal definition","Automaton"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a34ed415","kind":"definition","note":"Mathlib leaves the state and letter types unrestricted where the article asks for finite ones, and carries a whole set of start states where the article distinguishes one element, so it is inhabited by more machines than the article defines.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":61,"library":"mathlib","line":55,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[2996,3390],"span_sha256":"4f56f52641eca4fa4d8d67f888ff416ff7bc0d47c06282895c0c5386aec41c5c"}},"location":{"quote":{"exact":"a finite set of states Q {\\displaystyle Q} , a finite set"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #dcec0d00","location_key":"76c145a017aaf25b47f484a643b3f2d41c00b169a9096a52cb41b2442fd6d007","pair_key":"2acf650a636b1ee6e8321eb1f852c547268d261f8599f50b82f98f930aed4324","passage_key":"78fb798d00a6934b8a69ec41caf5c8dd6b8527bac857f47b197d03f68f5b6059","prominence":"supporting","rank":1,"section":["Formal definition","Automaton"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #dcec0d00","kind":"notation","note":"Mathlib carries the finite state set and each of its subsets as finite-set terms rather than as sets of states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":33,"library":"mathlib","line":31,"path":"Mathlib/Data/Finset/Powerset.lean","proof_status":"definition"}},"location":{"declaration":"Finset.powerset","module":"Mathlib.Data.Finset.Powerset"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[3391,3485],"span_sha256":"9ef4ebecf32d25a8767761e8c299b85f514aeb39b144f694444e3ff0d8c9719b"}},"location":{"quote":{"exact":"Here, P ( Q ) {\\displaystyle {\\mathcal {P}}(Q)} denotes the power set","suffix":" of Q {\\displaystyle Q} ."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #dcec0d00","location_key":"072c3735dabca3d2bf4f8f2a06481b7f038476eb1ac0040b6c78543e6e497e78","pair_key":"95ae98f3860b45c199e637bd7600d6c1861a1cbf099492225ac46371d1cf3bfe","passage_key":"78fb798d00a6934b8a69ec41caf5c8dd6b8527bac857f47b197d03f68f5b6059","prominence":"supporting","rank":2,"section":["Formal definition","Automaton"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #dcec0d00","kind":"notation","note":"Mathlib gives the power set of an arbitrary set, including infinite ones, where the passage names it for the finite state set of an automaton.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":255,"library":"mathlib","line":255,"path":"Mathlib/Data/Set/Defs.lean","proof_status":"definition"}},"location":{"declaration":"Set.powerset","module":"Mathlib.Data.Set.Defs"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[3391,3485],"span_sha256":"9ef4ebecf32d25a8767761e8c299b85f514aeb39b144f694444e3ff0d8c9719b"}},"location":{"quote":{"exact":"Here, P ( Q ) {\\displaystyle {\\mathcal {P}}(Q)} denotes the power set","suffix":" of Q {\\displaystyle Q} ."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #4c2b539a","location_key":"3b3d8305b26397d0ac35d0172072e5695151771fab31acaecad9aa35a6858030","pair_key":"70b627f9578da1eb72c7f95f0235378cec10d8c43a21e77770d127319fd9abde","passage_key":"b6306515ba7e84db334c6fa677a60cbe5d35711cc12fc03ecdd9d1adccfa3b37","prominence":"central","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #4c2b539a","kind":"definition","note":"Mathlib returns the accepted language of a machine whose carriers may be infinite and whose start states form a set, where the passage fixes a finite machine with one start state.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":253,"library":"mathlib","line":253,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[3506,3791],"span_sha256":"b1842dd29073460596a3596bcc563c1f21a514244bbc59d29b670b8ec88980f3"}},"location":{"quote":{"exact":"Given an NFA M = ( Q , Σ , δ ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #36ff5432","location_key":"55fe71a5108b44e862a10b6ae3e0368f5e962de42fdcb7f96bafb333a3688f1f","pair_key":"ad672c44db1a19cf2f51693677524bafa6d42f6eeca13c1c4dd57e990de05e8e","passage_key":"b0c35db2daaef568fc52ee43d0eacba31551e0fc6a0ec9b66cc37b2773858f2f","prominence":"central","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #36ff5432","kind":"definition","note":"Mathlib packages the run as an inductive family of paths rather than as an indexed list of states, and allows several start states where the passage has one.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[4009,4381],"span_sha256":"fa9393ac9419878ecbd929fc7cf7efb6ae7920710674f9afd0fee537f24c9e6e"}},"location":{"quote":{"exact":"w {\\displaystyle w} is accepted if a sequence of states, r 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #36ff5432","location_key":"2e34161e56abad3d805a07d8eb1b04d01826a56cd48483bc5e461797b48416aa","pair_key":"14d64ca91fba29ecf968e4f34704aae4c4e75910c6966608bd792670c7fddc2e","passage_key":"b0c35db2daaef568fc52ee43d0eacba31551e0fc6a0ec9b66cc37b2773858f2f","prominence":"central","rank":2,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #36ff5432","kind":"definition","note":"Mathlib carries the run as data indexed by its endpoints and its word, rather than as a list of states indexed by position.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":272,"library":"mathlib","line":269,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.Path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[4009,4381],"span_sha256":"fa9393ac9419878ecbd929fc7cf7efb6ae7920710674f9afd0fee537f24c9e6e"}},"location":{"quote":{"exact":"w {\\displaystyle w} is accepted if a sequence of states, r 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #29e0d6d1","location_key":"b736c8118a7902e8370624754d008b86aca704365004a7c643d000998cc7aebd","pair_key":"b31acd2aa929762cf4aa993e797745787f843b751ed1bf2e7293e8218e76653a","passage_key":"db27cfc0475cb22cb01e9df81cc1d5d0ddf41954410433ae6d83a992521dd2ff","prominence":"supporting","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #29e0d6d1","kind":"theorem","note":"Mathlib proves the full equivalence, whose right-to-left half is the sufficiency the passage asserts, and it holds for machines with a set of start states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[4854,5029],"span_sha256":"e5421b51aea7489f8d26b86e92e802d5447e46d12ce4ce6c76987c330353af4e"}},"location":{"quote":{"exact":"In order for w {\\displaystyle w} to be accepted by M {\\displaystyle"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #fb8d0f52","location_key":"91835f79dc6587d248c4f78909b42c577d08adfe22687fad863d5ac9afcc3cb8","pair_key":"25c991217ad4c8c662d2b073c810a531b6d3f1971173044dba37eda512c5e553","passage_key":"a0740181ecb6018f0773291940c0136b91e624ec04953e7a306900f75e374f7a","prominence":"supporting","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #fb8d0f52","kind":"definition","note":"Mathlib has no separate predicate for rejection: a rejected word is one outside the machine's accepted language, and the lemma is stated for machines with a set of start states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[5030,5231],"span_sha256":"87a93a3fd6e93e50ec3fdd3e4596199905a34764bffbef36561ebcb7f706dccb"}},"location":{"quote":{"exact":"Otherwise, i.e. if it is impossible at all to get from q"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #d439e09e","location_key":"12cf053d91c0dce035bbb72a26da5af5ad3e79554c97f22df6bfc78a2714dbe1","pair_key":"15c46a08bf4736ceac9bdd2daf1cbea56521af741e37a9f4f01b5bb64956d3ad","passage_key":"6d205282d4f15987e8eb3390e30ba71b5bba6eda8b98c9f570ff7acf42f8afc7","prominence":"supporting","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #d439e09e","kind":"definition","note":"Mathlib names this language of a machine whose carriers may be infinite and whose start states form a set, where the passage has a finite machine with one start state.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":253,"library":"mathlib","line":253,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[5232,5391],"span_sha256":"c306b68d1d2c06761c00ce51f2bb3c7ab21b7551ae4b35450a64f1b6e8044627"}},"location":{"quote":{"exact":"The set of strings M {\\displaystyle M} accepts is the language recognized"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","coverage":{"bundle_key":"1bb2e45bbabb993fe3f98beb7260567ca2e0ad1a4bf2e7a8cea1ed82ab1fe5a4","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","text":"w is accepted exactly when the set of states reached from the start state on w has a member in F"},{"id":"c2","part":"254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","text":"on the empty string the extended transition function returns just the state itself"},{"id":"c3","part":"0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422","text":"on a string followed by a symbol it returns the union of the transition sets of that symbol over all states reached on the string"}],"parts":["02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422"],"relation":"broadMatch"},"item":"In-text #444362ab","location_key":"02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","pair_key":"ca9b72f221a02affc718c8c0511f1d12a63a9a8bede3271748719a6a7e731153","passage_key":"31ebd886a0f47b17325099b6eb1e1a9521187040125bad713c22ac4edc125bda","prominence":"central","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #444362ab","kind":"definition","note":"Mathlib carries a set of start states and imposes no finiteness on states or symbols, so the singleton {q0} and the article's finite data are an instance of it.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[5404,6013],"span_sha256":"b1a6e5e7829be087e609dae8ad4222147384f95d1f3813cf470301431a19ae8c"}},"location":{"quote":{"exact":"Alternatively, w {\\displaystyle w} is accepted if δ ∗ ( q 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","coverage":{"bundle_key":"1bb2e45bbabb993fe3f98beb7260567ca2e0ad1a4bf2e7a8cea1ed82ab1fe5a4","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","text":"w is accepted exactly when the set of states reached from the start state on w has a member in F"},{"id":"c2","part":"254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","text":"on the empty string the extended transition function returns just the state itself"},{"id":"c3","part":"0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422","text":"on a string followed by a symbol it returns the union of the transition sets of that symbol over all states reached on the string"}],"parts":["02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422"],"relation":"broadMatch"},"item":"In-text #444362ab","location_key":"254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","pair_key":"3310943c71067f5aed8c3214dcd5c211a77f12687d612a2ffacaf58cd2cc935d","passage_key":"31ebd886a0f47b17325099b6eb1e1a9521187040125bad713c22ac4edc125bda","prominence":"central","rank":2,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #444362ab","kind":"definition","note":"The equation is stated for an arbitrary set of states, and the one-element set {r} is the case the article writes.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":103,"library":"mathlib","line":102,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_nil","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[5404,6013],"span_sha256":"b1a6e5e7829be087e609dae8ad4222147384f95d1f3813cf470301431a19ae8c"}},"location":{"quote":{"exact":"Alternatively, w {\\displaystyle w} is accepted if δ ∗ ( q 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","coverage":{"bundle_key":"1bb2e45bbabb993fe3f98beb7260567ca2e0ad1a4bf2e7a8cea1ed82ab1fe5a4","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","text":"w is accepted exactly when the set of states reached from the start state on w has a member in F"},{"id":"c2","part":"254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","text":"on the empty string the extended transition function returns just the state itself"},{"id":"c3","part":"0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422","text":"on a string followed by a symbol it returns the union of the transition sets of that symbol over all states reached on the string"}],"parts":["02b1a53a520f0b000de428b9e50eb941ff64200ec63bae865954073dc953669d","254a8a3b5368cb893c7885a5d84384a5578c84026381283608ccbb41131a610c","0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422"],"relation":"broadMatch"},"item":"In-text #444362ab","location_key":"0653cc1deef2a0d01fddbd37ea5949cc8294f1d622055301234e5b85cde3b422","pair_key":"484fca6f80bc1fc8ead6a094e4190b3ed8bfb8f1d7c714c676ba7c08f99dad64","passage_key":"31ebd886a0f47b17325099b6eb1e1a9521187040125bad713c22ac4edc125bda","prominence":"central","rank":3,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #444362ab","kind":"definition","note":"Evaluation on a one-symbol word is by definition Mathlib's step-set operation, namely the union of the transition sets over the current states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":120,"library":"mathlib","line":118,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_append","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[5404,6013],"span_sha256":"b1a6e5e7829be087e609dae8ad4222147384f95d1f3813cf470301431a19ae8c"}},"location":{"quote":{"exact":"Alternatively, w {\\displaystyle w} is accepted if δ ∗ ( q 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #cd32831e","location_key":"2d3fcdd42fd291f3175025e1266028fc0712e6f9831cf4e27cabac1acec24498","pair_key":"ac646eb638030c055a47230573eba257c55f31debd55f300566a9bb2971631bd","passage_key":"df2394fbac218cb10ae0e7834838d25c1e263e85c53661fbab6b81795fd997f9","prominence":"supporting","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #cd32831e","kind":"theorem","note":"Mathlib writes the set element by element and names reachability by its inductive path type, and it puts no finiteness condition on the states or the alphabet.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":296,"library":"mathlib","line":280,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_evalFrom_iff_nonempty_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[6014,6182],"span_sha256":"6effcbdc0e2ed6ec2356cf09cef4cf3c4504cf9903831839a6e7e9a032eaae92"}},"location":{"quote":{"exact":"In words, δ ∗ ( r , x ) {\\displaystyle \\delta ^{*}(r,x)}"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #3ac66040","location_key":"f778c46c4bb17959d6949564c88cdde72c992f12c8faf6523250f5c7a8a5636a","pair_key":"a7014caf9dc5c623e1013caacee6c7112b29f3848bcfa14f8923718b15aa4deb","passage_key":"9255df36cebc380fe36b01b32359440ac6b7a467123366de838175f28dc1fd4a","prominence":"supporting","rank":1,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3ac66040","kind":"theorem","note":"Mathlib allows a set of start states and no finiteness condition, and the article's single start state is the singleton case.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[6183,6369],"span_sha256":"f115c8f43f32447067208781d9889fb2f73fe6b5dd3f9cac208904286a0b549e"}},"location":{"quote":{"exact":"The string w {\\displaystyle w} is accepted if some accepting state in"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #3ac66040","location_key":"895811518eee920ba5bdb4192afab79f19050e274a5394b25d755925224e7ccf","pair_key":"8cab3d0bf596d7f0df44018736f5fb0b220679ed0f05df3b4f4b371fba3028c1","passage_key":"9255df36cebc380fe36b01b32359440ac6b7a467123366de838175f28dc1fd4a","prominence":"supporting","rank":2,"section":["Formal definition","Recognized language"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3ac66040","kind":"theorem","note":"This phrases the same criterion through the evaluated set of reached states rather than through a path.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[6183,6369],"span_sha256":"f115c8f43f32447067208781d9889fb2f73fe6b5dd3f9cac208904286a0b549e"}},"location":{"quote":{"exact":"The string w {\\displaystyle w} is accepted if some accepting state in"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #c67fc943","passage_key":"1e55b5337ef76bd36fb1cc63265026a811be2cfae5a7896f6b1c81fa716970c3","prominence":"supporting","receipt":{"candidates":4,"queries":4,"sha256":"d19b5569ece17e5a0b9bc6031c6400d9cc306747a5df31a1a453fd87004ed173"},"section":["Formal definition","Initial state"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #c67fc943","kind":"construction","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[6533,6691],"span_sha256":"7a662f0c67c7212bc9d6c70565aeb6f97168f0304505dcc4707bbe4c28109569"}},"location":{"quote":{"exact":"There is an easy construction that translates an NFA with multiple initial"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #5733f4ee","location_key":"832a9dca7d33787e05a2928fef56baf3ac9b9defcaef3dd7c3141cf5375cb1b8","pair_key":"9043038b186eb2df55a8ab21a2387255c494acc71ee601d964c93e7d680ccf84","passage_key":"5870ac1a825b8b4f91e7c3c24b9dc5982e7a5aadc46ad89683d52b8c3b2d0140","prominence":"central","rank":1,"section":["Formal definition","Isomorphism"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5733f4ee","kind":"definition","note":"The lemma is stated for deterministic automata, which the article itself counts among its automata, and for the particular second automaton obtained by relabelling along the bijection.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":229,"library":"mathlib","line":229,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.reindex_apply_start","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[7006,7443],"span_sha256":"d47fc76979982e0378d52f1a4858adde1c1dbdb88002a8fa1276d832a6483e80"}},"location":{"quote":{"exact":"φ ( q 0 ) = q 0 ′ {\\displaystyle \\varphi (q_{0})=q'_{0}}"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #5733f4ee","location_key":"29ede8f593a1a9648c05a10479c770293b6c852423d47369f862e58c18b43fc3","pair_key":"0c016b1c9e34bcfade8028eab028b4fd9898d3d3def4551e97e6140ae4d9b40e","passage_key":"5870ac1a825b8b4f91e7c3c24b9dc5982e7a5aadc46ad89683d52b8c3b2d0140","prominence":"central","rank":2,"section":["Formal definition","Isomorphism"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5733f4ee","kind":"definition","note":"The accepting set of the relabelled automaton is described as the preimage along the inverse bijection, which is the article's two-way condition on accepting states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":229,"library":"mathlib","line":229,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.reindex_apply_accept","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[7006,7443],"span_sha256":"d47fc76979982e0378d52f1a4858adde1c1dbdb88002a8fa1276d832a6483e80"}},"location":{"quote":{"exact":"φ ( q 0 ) = q 0 ′ {\\displaystyle \\varphi (q_{0})=q'_{0}}"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #5733f4ee","location_key":"472f0554bc41a0114b8f71474d257982dc0840b57a3dca1436b54bb751d8c421","pair_key":"27dd516f4bb555409aa57741cbcfb8498c743108b54a41ba0b0b2f70ef2a001a","passage_key":"5870ac1a825b8b4f91e7c3c24b9dc5982e7a5aadc46ad89683d52b8c3b2d0140","prominence":"central","rank":3,"section":["Formal definition","Isomorphism"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5733f4ee","kind":"definition","note":"For deterministic automata the transition set is a single state, so the equation between the two transition functions is the article's two-way condition on transitions.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":229,"library":"mathlib","line":229,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.reindex_apply_step","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[7006,7443],"span_sha256":"d47fc76979982e0378d52f1a4858adde1c1dbdb88002a8fa1276d832a6483e80"}},"location":{"quote":{"exact":"φ ( q 0 ) = q 0 ′ {\\displaystyle \\varphi (q_{0})=q'_{0}}"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #f6672c32","passage_key":"737a4fe55a4f56a63308fc2a3ed6be4ae25645c088902c68e707bbc0e044ce4c","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"96c0d1109fb63a8ad072da5d0f886b67034b5237ef1e20077df1301af94e16ba"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #f6672c32","kind":"example","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[7958,8047],"span_sha256":"26a3a0b1253c72e04b3374ab9692fcac3ba578e1bd3981cbc204fe6c1975c72e"}},"location":{"quote":{"exact":"The following automaton M, with a binary alphabet, determines if the input"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #c9abbf55","passage_key":"923d36babaef48a8c486d854c13efed48d7ff9b30434f389e97ec8465309fa92","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"339a0e30cb4708d39a6febdf6aea6f86bb840535ad6b10cb42b4b0c56c0d00f9"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #c9abbf55","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[8560,8582],"span_sha256":"0af3ce78e798f0ed0769067a46e7b075c170adeabd4b398970764c155a66b9f6"}},"location":{"quote":{"exact":"M is nondeterministic."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #9d9904e3","passage_key":"f990a72a75bc43239a864b558ae97346e55108364e704cdf250eb4f103d04b63","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"0a67d3369bd950352f0b9029ea070e32506fd959c435b6bbec323f222a656d13"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #9d9904e3","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[8583,8682],"span_sha256":"606f9b01575b4405e6c7a3b6da70298228bfeef72fd81f67bf06ceac7e806cc4"}},"location":{"quote":{"exact":"The language of M can be described by the regular language given"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #51df03bb","location_key":"6a87465c8308c587d69f6f2163ef4030aa03509872b35c93fb778f2d040813b6","pair_key":"28fbe8d5643a886422bbc02207b3516676b37312941829d74aba5ea3010ec2e5","passage_key":"99fcd220c639ef782aca5630bb95e7a788e41e563d489bb74abdf3500c5cb729","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #51df03bb","kind":"theorem","note":"It is the acceptance test for an arbitrary automaton and an arbitrary word; it fixes no transition table, so the verdict on this two-state machine and this word is beyond what it says.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[8772,8799],"span_sha256":"4acf014c9e7ba9ce93dafb341c53e875006bf5735003c8d771a1d33a2f7f3dbc"}},"location":{"quote":{"exact":"The string is accepted by M"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #51df03bb","passage_key":"99fcd220c639ef782aca5630bb95e7a788e41e563d489bb74abdf3500c5cb729","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"9b01628c69829aa6836a258b8e2642b8132fb130cd64fc64f4166a076ad3704a"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #51df03bb","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[8772,8799],"span_sha256":"4acf014c9e7ba9ce93dafb341c53e875006bf5735003c8d771a1d33a2f7f3dbc"}},"location":{"quote":{"exact":"The string is accepted by M"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #68324597","location_key":"db5ecabebadebb60eed5ae5d3cae14c52e7bcfd8a3d5142db79ef38f3da03dcf","pair_key":"d45369de5cf9eb216891e437d0bd27f8a2430c27671193721c34a6b8761b0d73","passage_key":"d6e29e74804a2b0fc988f19154f7adaba7ec3a051a6e4cd5e7190a88f57fa09d","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #68324597","kind":"theorem","note":"This is the run-based reading of acceptance for an arbitrary automaton: a word is in the language exactly when some run joins a start state to an accepting one. It settles no concrete machine.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":301,"library":"mathlib","line":298,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.accepts_iff_exists_path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9415,9488],"span_sha256":"eab5aa4643c6d30744133501663d22d78297a3ea00fa8ac389d97953056bc1db"}},"location":{"quote":{"exact":"Considering the first of the above formal definitions, \"1011\" is accepted"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #68324597","passage_key":"d6e29e74804a2b0fc988f19154f7adaba7ec3a051a6e4cd5e7190a88f57fa09d","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"b465e3b35a2af2def37ed9e0991694d5a4c232587ad850391af0f2c82512b05f"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #68324597","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9415,9488],"span_sha256":"eab5aa4643c6d30744133501663d22d78297a3ea00fa8ac389d97953056bc1db"}},"location":{"quote":{"exact":"Considering the first of the above formal definitions, \"1011\" is accepted"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #5cd71600","location_key":"0058416629e8d3a96d8f8c299b329a664e5f4c6fad44f6b395146b26ab47f137","pair_key":"e8d4b4a97ef0dee7f0ecf7de9b7c1019c9d5cb7644ebdda5b23e92deb9a03f3b","passage_key":"6204ec50d5975050a86a0743685d6440af3d821a636d3084a93569f8299fd26e","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5cd71600","kind":"theorem","note":"The inductive family of concrete runs of an arbitrary automaton between two states for a given word; it is the vocabulary in which the passage's run would be written, not an assertion that this run exists.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":272,"library":"mathlib","line":269,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.Path","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9495,9725],"span_sha256":"fcd77a4a3bdd83fe6b51bf681306e2bdea3524ed210946c8ba45eb97d01b535d"}},"location":{"quote":{"exact":"when reading it M may traverse the state sequence ⟨ r 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #5cd71600","passage_key":"6204ec50d5975050a86a0743685d6440af3d821a636d3084a93569f8299fd26e","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"a46218a63ee3c6fdf78bc103f31e04960e799bfe07eccedd4c94a1174e04722a"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5cd71600","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9495,9725],"span_sha256":"fcd77a4a3bdd83fe6b51bf681306e2bdea3524ed210946c8ba45eb97d01b535d"}},"location":{"quote":{"exact":"when reading it M may traverse the state sequence ⟨ r 0"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #38b9ff36","location_key":"a449df83fb0077a12f432c5c240634abc10d14eb4eeb2c1d0c480e1f0b304b61","pair_key":"723f1eb83038488954d13e714292289937187fb8536f8472d9d33b89a00cc2ea","passage_key":"cf54f62746927aab9eeba4410df842a1be9bb69a4facaafbccb640ba2c9a5414","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #38b9ff36","kind":"theorem","note":"The lemma holds for every automaton and every set of starting states, so the passage's case is one instance; mathlib's evalFrom reads a set of states where the article writes the single state p, and the matching set is {p}.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":103,"library":"mathlib","line":102,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_nil","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9726,9871],"span_sha256":"6340712006393fe25c5e253b0ce5a5b5d8b4635b3961454af4e15e1d9a83ffb5"}},"location":{"quote":{"exact":"Concerning the second formal definition, bottom-up computation shows that δ ∗ ("}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #38b9ff36","location_key":"52be15222e2d7497fe6d95e2084cb0809d8e8267bc53cf92e9ae6641b50160c3","pair_key":"692cd0db763339ba27861bed0491e2db135ec6869be4bf34b6664f55dabb298e","passage_key":"cf54f62746927aab9eeba4410df842a1be9bb69a4facaafbccb640ba2c9a5414","prominence":"supporting","rank":2,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #38b9ff36","kind":"theorem","note":"mathlib's eval runs a word from the machine's own start states; for this machine that set is the singleton of p, and the lemma at the empty word returns it unchanged.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":238,"library":"mathlib","line":237,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.eval_nil","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9726,9871],"span_sha256":"6340712006393fe25c5e253b0ce5a5b5d8b4635b3961454af4e15e1d9a83ffb5"}},"location":{"quote":{"exact":"Concerning the second formal definition, bottom-up computation shows that δ ∗ ("}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #89385fb7","location_key":"41afe584c42bbe0094bbe6c6fe893eea2080d817ab3f7d4fd8bd734182077d46","pair_key":"7889a2c27aef936f40ea97e766a0e10793ad9a76ad603aace662cebef9754a2e","passage_key":"2867c644534696bf960a0a940c3ca1160c2f0032fc1b03c49f159bb61f4eff1e","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #89385fb7","kind":"theorem","note":"For any automaton and any starting set it rewrites a one-letter word as a single transition step; that is the intermediate move of the displayed chain, while the value the chain ends at is read off this machine's table.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":108,"library":"mathlib","line":107,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_singleton","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9880,9973],"span_sha256":"46c7477879c0a871226cbde46e10140d3c28fecf6cdc91597565564ed5a9951a"}},"location":{"quote":{"exact":"δ ∗ ( p , 1 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #89385fb7","location_key":"64a96d6797f4ab737d9037011ec88ceb0d2389bda709ffe78e4fc780dfe84176","pair_key":"76dede3c1a607c5cc7fe610177f323a116c1f0758601819473507a0f502ac123","passage_key":"2867c644534696bf960a0a940c3ca1160c2f0032fc1b03c49f159bb61f4eff1e","prominence":"supporting","rank":2,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #89385fb7","kind":"theorem","note":"A step from a one-element set of states is the transition of that state, for any automaton; the pair of states the passage records comes from this machine's table instead.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":85,"library":"mathlib","line":84,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.stepSet_singleton","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9880,9973],"span_sha256":"46c7477879c0a871226cbde46e10140d3c28fecf6cdc91597565564ed5a9951a"}},"location":{"quote":{"exact":"δ ∗ ( p , 1 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #89385fb7","passage_key":"2867c644534696bf960a0a940c3ca1160c2f0032fc1b03c49f159bb61f4eff1e","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"6769c379a421ddaeb3dab60b23101b43a9994f457a825ea2c72693553e9246c6"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #89385fb7","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9880,9973],"span_sha256":"46c7477879c0a871226cbde46e10140d3c28fecf6cdc91597565564ed5a9951a"}},"location":{"quote":{"exact":"δ ∗ ( p , 1 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #dd2f91a5","location_key":"21d96035e04ae92cececb36a8f410906910b38628760a67d49f8e141925c69a1","pair_key":"52d11db5d7ec2d2e524f623737215fba749e6f56f6adf741f1879fa3e3c996ca","passage_key":"7611b3247af6ba0d85b426a55d333742d12e8878af946c55130096b9dbd97be9","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #dd2f91a5","kind":"theorem","note":"It splits a word in two and runs the pieces in turn, for any automaton and starting set; that recursion is how the article moves from one prefix to the next, but the sets it lands in come from this machine's table.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":120,"library":"mathlib","line":118,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_append","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9982,10117],"span_sha256":"e0055b86ebab1b3cb9489fe1729c52da315e9c0642ff6a6de7149294e45e15db"}},"location":{"quote":{"exact":"δ ∗ ( p , 10 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #dd2f91a5","location_key":"62e1badccef13ec8853dbca0422664ec7c79406eeb590bd64cdabacba643e9fd","pair_key":"674277b30a4faa9c2c33ead53d217e81883d6033c30ffc22ab16e4dd9363aa34","passage_key":"7611b3247af6ba0d85b426a55d333742d12e8878af946c55130096b9dbd97be9","prominence":"supporting","rank":2,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #dd2f91a5","kind":"theorem","note":"The definition of one step from a set of states as the union of the transitions of its members, for any automaton; the union the passage displays is an instance of that shape with values this machine's table supplies.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":73,"library":"mathlib","line":72,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.stepSet","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9982,10117],"span_sha256":"e0055b86ebab1b3cb9489fe1729c52da315e9c0642ff6a6de7149294e45e15db"}},"location":{"quote":{"exact":"δ ∗ ( p , 10 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #dd2f91a5","passage_key":"7611b3247af6ba0d85b426a55d333742d12e8878af946c55130096b9dbd97be9","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"7827ee2a7dd74dcde76adc95e4e60f646e35976c89875766f981e15b8542bc80"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #dd2f91a5","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[9982,10117],"span_sha256":"e0055b86ebab1b3cb9489fe1729c52da315e9c0642ff6a6de7149294e45e15db"}},"location":{"quote":{"exact":"δ ∗ ( p , 10 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #590e7cce","location_key":"346c77c92089170800b2025ce3e27df3c06d224d2356c719e3236453c1ccbe14","pair_key":"9a4b6725e60389f1b5317f7f2299d870e6026f1c165ea60a6ccb673d0840e543","passage_key":"4510706dfd90a9fd767146e475637a9732e7dd41e0d97732ddb08ffbe89844c9","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #590e7cce","kind":"theorem","note":"For any automaton it runs a word prefix first and the rest afterwards, which is the recursion carrying the article from the prefix 10 to the prefix 101; the resulting states are those this machine's table gives.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":120,"library":"mathlib","line":118,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_append","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10126,10223],"span_sha256":"9eaa1771e5cb6bfcd89d07bd2e7fe17dd7c8612a7e9ce246f28c913ef8cb2b73"}},"location":{"quote":{"exact":"δ ∗ ( p , 101 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #590e7cce","location_key":"86e31449691610eaa7f70b763a248252dbca5a302d5e533b5e161210dbf1a74f","pair_key":"593fce4aba73ec2909d21042fb9c8f6d3a2d1700dc05082076b409f6e22983f8","passage_key":"4510706dfd90a9fd767146e475637a9732e7dd41e0d97732ddb08ffbe89844c9","prominence":"supporting","rank":2,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #590e7cce","kind":"theorem","note":"A step from a one-element set of states is that state's transition, for any automaton; which pair of states the letter 1 then yields is settled by the table the article displays.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":85,"library":"mathlib","line":84,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.stepSet_singleton","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10126,10223],"span_sha256":"9eaa1771e5cb6bfcd89d07bd2e7fe17dd7c8612a7e9ce246f28c913ef8cb2b73"}},"location":{"quote":{"exact":"δ ∗ ( p , 101 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #590e7cce","passage_key":"4510706dfd90a9fd767146e475637a9732e7dd41e0d97732ddb08ffbe89844c9","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"300f90fa9f16ad577e964d379d841b19e1526495e66e833b26d3a51f8daa6796"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #590e7cce","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10126,10223],"span_sha256":"9eaa1771e5cb6bfcd89d07bd2e7fe17dd7c8612a7e9ce246f28c913ef8cb2b73"}},"location":{"quote":{"exact":"δ ∗ ( p , 101 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #da7162ce","location_key":"663b0adebd06443fa08b52e935b3fca0654fd4fe0ff96a4c7c63b71506013fee","pair_key":"6bb40415d0a51d7668f733a4754522c1cdc026bcf664d9b84a6285dae3061eb8","passage_key":"3eea6fc331076419d9e660b363cf2ddb92f15f3d8dff14ebdf4d90d95da94089","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #da7162ce","kind":"theorem","note":"For any automaton it runs a prefix and then the remaining letter, which is the recursion that takes the article from 101 to the full word; the sets it names come from this machine's table.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":120,"library":"mathlib","line":118,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.evalFrom_append","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10236,10381],"span_sha256":"d242b59c4419c691a46d9fbfe7ce39d1c5d9d02b825a8511ecfb397beb0d2b13"}},"location":{"quote":{"exact":"δ ∗ ( p , 1011 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #da7162ce","location_key":"4e1e8c1c5dca0a80837c70254017e4571f105d60615717cce9835b09c3311e74","pair_key":"ede14e8da5c68ce0d6f037dffc9bc04335674bf1c69ca85dada7e40f1aecd2f5","passage_key":"3eea6fc331076419d9e660b363cf2ddb92f15f3d8dff14ebdf4d90d95da94089","prominence":"supporting","rank":2,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #da7162ce","kind":"theorem","note":"A step from a union of two sets of states is the union of the two steps, for any automaton; the union the passage displays has that shape, with values read off this machine's table.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":92,"library":"mathlib","line":89,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.stepSet_union","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10236,10381],"span_sha256":"d242b59c4419c691a46d9fbfe7ce39d1c5d9d02b825a8511ecfb397beb0d2b13"}},"location":{"quote":{"exact":"δ ∗ ( p , 1011 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #da7162ce","passage_key":"3eea6fc331076419d9e660b363cf2ddb92f15f3d8dff14ebdf4d90d95da94089","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"70417acfe8e7af8fe03433cbb1688f08e848b8890b7e27188ab591c42b46208d"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #da7162ce","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10236,10381],"span_sha256":"d242b59c4419c691a46d9fbfe7ce39d1c5d9d02b825a8511ecfb397beb0d2b13"}},"location":{"quote":{"exact":"δ ∗ ( p , 1011 ) = δ ( p ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #138fad1c","location_key":"5be39f003bfdd450ad275d7df38486c982e2de595b9c167c1e5dabee8152611f","pair_key":"881195f739a530ea4d9a7c1ba42d700e240a6f94c82827e5c5aaca5c873d5154","passage_key":"a2c53dee76533dd1348308dc811a43c17defdf58671619fe30c920dc81d86752","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #138fad1c","kind":"theorem","note":"It is the general acceptance test, not a claim about the article's machine.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10450,10480],"span_sha256":"81adcf732226c098bc0f82377daade810010697730c9a17db7a23180c5b8874f"}},"location":{"quote":{"exact":"the string \"1011\" is accepted."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #138fad1c","passage_key":"a2c53dee76533dd1348308dc811a43c17defdf58671619fe30c920dc81d86752","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"af1492217306822ecb2b66ddfaebeef52dab83b5b004a2b2872a6a44ed0cf023"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #138fad1c","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10450,10480],"span_sha256":"81adcf732226c098bc0f82377daade810010697730c9a17db7a23180c5b8874f"}},"location":{"quote":{"exact":"the string \"1011\" is accepted."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #a60f49bc","location_key":"528c0c3bce339a31928dd336fb68a207fad0096927fc722fc6640309e0fe1523","pair_key":"702363daf93ea64d3fbfa604a54254c2379625652b7ee63f7b4e7fd59bd4586a","passage_key":"94789452dc3c554440dc49df919615bc31d9a07d0abb53ace51c930bdd4d7d16","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a60f49bc","kind":"theorem","note":"Its negation would express rejection, but only for an arbitrary automaton.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10481,10526],"span_sha256":"9425847225cb903040d5ebab45d8cea80a5394a5fb2380b33934a053e676bccd"}},"location":{"quote":{"exact":"In contrast, the string \"10\" is rejected by M"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #a60f49bc","passage_key":"94789452dc3c554440dc49df919615bc31d9a07d0abb53ace51c930bdd4d7d16","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"4e218359928d60f0dd4841c6a0be02147459fcdf4754960e3109cb2a84b64316"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a60f49bc","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10481,10526],"span_sha256":"9425847225cb903040d5ebab45d8cea80a5394a5fb2380b33934a053e676bccd"}},"location":{"quote":{"exact":"In contrast, the string \"10\" is rejected by M"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #49214479","location_key":"333c31f1e7ff33f0fd09365195fdd5f67f7a732a7f5ab9febaf4a76ff0ac0889","pair_key":"00a1053f2831a4ab320d8d9ed989b6c7b069ca085ee0dbdcbefc5a775cd9a966","passage_key":"c9f62759f058a24fab42b1ea68de13066329c29f73950ceb1fcafab48d3e57f5","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #49214479","kind":"theorem","note":"It unfolds which states one step on a symbol can reach, for any automaton.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":76,"library":"mathlib","line":75,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_stepSet","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10617,10701],"span_sha256":"2869ebefdb22348002e4cadc1052d538616b822722635bcd093a025c541be18c"}},"location":{"quote":{"exact":"there is no way to reach the only accepting state, q, by"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #49214479","passage_key":"c9f62759f058a24fab42b1ea68de13066329c29f73950ceb1fcafab48d3e57f5","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"e6f1746b558afc44730e08feb1de0c8e16c4bd361c89df3a36a54226418506ff"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #49214479","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10617,10701],"span_sha256":"2869ebefdb22348002e4cadc1052d538616b822722635bcd093a025c541be18c"}},"location":{"quote":{"exact":"there is no way to reach the only accepting state, q, by"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #40a34114","location_key":"6a8e989b4ed3e733e567138cb5ece81c25dd5b63517771d240bebe256792c406","pair_key":"86193fa72e376346f2ee67d68b3b88591dad7efa7c2220a3f9204f81ccd476e5","passage_key":"b5b1ff122379bf72091e706bf7e547dfe64694d9f2209c02a109c955644c769e","prominence":"supporting","rank":1,"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #40a34114","kind":"theorem","note":"It is the general acceptance test applied to any word, including one-letter words.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10810,10870],"span_sha256":"1c72075273a6cffa644ede7d7df70e0383e28f30a5881f3e4814d3b2b2f35c5c"}},"location":{"quote":{"exact":"rather, it means that an input string \"1\" would be accepted."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #40a34114","passage_key":"b5b1ff122379bf72091e706bf7e547dfe64694d9f2209c02a109c955644c769e","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"9152454b4e979d6d71e7002feddfb537654e14919c0f16faf5b031567ee99154"},"section":["Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #40a34114","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10810,10870],"span_sha256":"1c72075273a6cffa644ede7d7df70e0383e28f30a5881f3e4814d3b2b2f35c5c"}},"location":{"quote":{"exact":"rather, it means that an input string \"1\" would be accepted."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #96401e50","location_key":"9d286ba7bc88c7cc5fc4a2a4940eb45cf9c5326fb63141dd73d92bc886b26cfb","pair_key":"bf0477282011241bb73bb4137c3db0950507608253b7e134ef19c499cbf38add","passage_key":"17b74d0f43e74932d6219efe348584956b87944d71856f4d4a402b987d860e3e","prominence":"central","rank":1,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #96401e50","kind":"definition","note":"The construction keeps the start state and the accept set and sends each state and symbol to the one element set holding the deterministic successor.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":334,"library":"mathlib","line":331,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"DFA.toNFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"exactMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10890,11049],"span_sha256":"94300d1f323a63b865bb823f434e60f73aa8dbd143d731cfc84dc296770e3818"}},"location":{"quote":{"exact":"A deterministic finite automaton (DFA) can be seen as a special kind"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #96401e50","location_key":"506cb12a89d09670b85472ee31100da6783d088e03202b56b9ccfdfca82e399e","pair_key":"16c92ade9f10e711f9e0284a1e522b406b290514759a802d060b1ca529603272","passage_key":"17b74d0f43e74932d6219efe348584956b87944d71856f4d4a402b987d860e3e","prominence":"central","rank":2,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #96401e50","kind":"definition","note":"The theorem unfolds the transition of the associated NFA to the one element set holding the deterministic successor.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":331,"library":"mathlib","line":331,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.toNFA_step","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[10890,11049],"span_sha256":"94300d1f323a63b865bb823f434e60f73aa8dbd143d731cfc84dc296770e3818"}},"location":{"quote":{"exact":"A deterministic finite automaton (DFA) can be seen as a special kind"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #cbcfd9d7","location_key":"830ec2027cc5259cd9eb746cb6257c13a84dea7883473b2c10af5e990f0ca594","pair_key":"e4b5709c7f999074a7bcadcbd96e765aaa02c34d027cc314c3c0e9f9c87d60cc","passage_key":"6b8e32a3efa7b0126f89ea8686ecc347433600cd1bcfa13a27bbd541f0d1ac8e","prominence":"central","rank":1,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #cbcfd9d7","kind":"theorem","note":"The theorem names an explicit witness automaton for each deterministic one and equates the two recognised languages.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":354,"library":"mathlib","line":348,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.toNFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11050,11155],"span_sha256":"5068b8f21d9a0a0a633fbc7c8326ced760f48428118961197daf9603f90a0afb"}},"location":{"quote":{"exact":"Thus, it is clear that every formal language that can be recognized"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #cbcfd9d7","location_key":"92e6379972785b2e22c408a9d253b6a162808f3e3944a7da4f6f409fd349d21b","pair_key":"c03747664c85c3e065f896097a9ee7eebd87b0b3ddfa53a171871ab6b64b5ab9","passage_key":"6b8e32a3efa7b0126f89ea8686ecc347433600cd1bcfa13a27bbd541f0d1ac8e","prominence":"central","rank":2,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #cbcfd9d7","kind":"theorem","note":"It supplies the witness automaton but makes no claim about languages.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":334,"library":"mathlib","line":331,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"DFA.toNFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11050,11155],"span_sha256":"5068b8f21d9a0a0a633fbc7c8326ced760f48428118961197daf9603f90a0afb"}},"location":{"quote":{"exact":"Thus, it is clear that every formal language that can be recognized"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #44a1d3c6","location_key":"002ca5ffb9bcdbd48d30dc1fe9096365e47009359ffdd9dcad9b86cf190b4b5d","pair_key":"55db7e507834519f870efe32459b82c4dfcfa680731ca95b69186cfed5717727","passage_key":"8bbad1ce934121cea1145bcd0fd311f6a273088a7bd64214b3ef41ec2a7dd864","prominence":"central","rank":1,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #44a1d3c6","kind":"theorem","note":"The theorem equates the language of the subset construction automaton with the language of the given nondeterministic one.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11156,11246],"span_sha256":"8d7b3a071ec92aaf98270c049eaa60e36d6e8af2eb4a28d96b2b9303b318c091"}},"location":{"quote":{"exact":"Conversely, for each NFA, there is a DFA such that it recognizes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #44a1d3c6","location_key":"723e5e9229b5f99c4de840ff8a5e353ca414241ca643d2d1de9d6ad448d11080","pair_key":"f28f2e3bba9a24c7cfa7a086fba435993bfcece6b47f1de0e67f33b0b0cf1f2d","passage_key":"8bbad1ce934121cea1145bcd0fd311f6a273088a7bd64214b3ef41ec2a7dd864","prominence":"central","rank":2,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #44a1d3c6","kind":"theorem","note":"It is the subset construction itself, with no claim about languages.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":309,"library":"mathlib","line":306,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.toDFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11156,11246],"span_sha256":"8d7b3a071ec92aaf98270c049eaa60e36d6e8af2eb4a28d96b2b9303b318c091"}},"location":{"quote":{"exact":"Conversely, for each NFA, there is a DFA such that it recognizes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #ce96fcfe","location_key":"f0a751123f7da6a093e10458cc6dd9445fb34c961b01482f67ca017c7bb6af2c","pair_key":"d9e8dbf56483725f9283230fd9eb16a2a3eb1771070358ab038d89774f70b242","passage_key":"e14dff704824df530550641a51e9b9523381b874c20c75d54ddcc0e9538c8c47","prominence":"supporting","rank":1,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ce96fcfe","kind":"theorem","note":"The theorem counts the sets of states of a finite state type, and that count is the number of states of the automaton the subset construction produces.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":69,"library":"mathlib","line":68,"path":"Mathlib/Data/Fintype/Powerset.lean","proof_status":"proved"}},"location":{"declaration":"Fintype.card_set","module":"Mathlib.Data.Fintype.Powerset"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11559,11703],"span_sha256":"16be3de779aaffad43fa27fe9bd4c790ad2cb93ea93e3b8c367fc8ef2edb70ef"}},"location":{"quote":{"exact":"However, if the NFA has n states, the resulting DFA may have"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #ce96fcfe","location_key":"7c011c0babf26d045ca989c5773d18912ed91fa47b0caabb69ac20323de4b77a","pair_key":"7a1701bee36b69d31298311ea96a4f01a48c3f060743fed78ae8b64744eda2af","passage_key":"e14dff704824df530550641a51e9b9523381b874c20c75d54ddcc0e9538c8c47","prominence":"supporting","rank":2,"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ce96fcfe","kind":"theorem","note":"Its type shows the built automaton has sets of states as states, with no count attached.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":309,"library":"mathlib","line":306,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.toDFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11559,11703],"span_sha256":"16be3de779aaffad43fa27fe9bd4c790ad2cb93ea93e3b8c367fc8ef2edb70ef"}},"location":{"quote":{"exact":"However, if the NFA has n states, the resulting DFA may have"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #ce96fcfe","passage_key":"e14dff704824df530550641a51e9b9523381b874c20c75d54ddcc0e9538c8c47","prominence":"supporting","receipt":{"candidates":0,"queries":4,"sha256":"4f544fd6aad203440c22a34d2cc0ac89cd80c8b5346ab94f109ba5b64ad13ef3"},"section":["Equivalence to DFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ce96fcfe","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11559,11703],"span_sha256":"16be3de779aaffad43fa27fe9bd4c790ad2cb93ea93e3b8c367fc8ef2edb70ef"}},"location":{"quote":{"exact":"However, if the NFA has n states, the resulting DFA may have"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #64e4d3ed","location_key":"f5463bbcf31b077594bc0d037a0dcf8e1921f2cf24b4afc8dc3cf50da1d8e7fe","pair_key":"e1852589d199e10ad1a958a14b0e953f621798e20106f4c5c2e015f516e88195","passage_key":"00550000c073a116b2829d1d85c87e0a46b90e6f0c9a8d2f8a652c5ce0e73706","prominence":"central","rank":1,"section":["NFA with ε-moves"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #64e4d3ed","kind":"definition","note":"The theorem is stated about the canonical conversion, over arbitrary state and alphabet types, and says the accepted language is unchanged.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":352,"library":"mathlib","line":350,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toεNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11721,11811],"span_sha256":"64e4d3edfea9f42760772b1bc190576126c4209f02ee0cf03eaedcd2d1d435a1"}},"location":{"quote":{"exact":"Nondeterministic finite automaton with ε-moves (NFA-ε) is a further generalization to NFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #64e4d3ed","location_key":"631d587164dda81bb9e5de43628991f68a418793231da9a99b49036650dfcdc7","pair_key":"2501e181146388a0438774046ee9bd98f08614029bf2c3423bbaa03920afecae","passage_key":"00550000c073a116b2829d1d85c87e0a46b90e6f0c9a8d2f8a652c5ce0e73706","prominence":"central","rank":2,"section":["NFA with ε-moves"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #64e4d3ed","kind":"definition","note":"This is only the conversion map; on its own it does not record that the two machines accept the same words.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":330,"library":"mathlib","line":327,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.toεNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11721,11811],"span_sha256":"64e4d3edfea9f42760772b1bc190576126c4209f02ee0cf03eaedcd2d1d435a1"}},"location":{"quote":{"exact":"Nondeterministic finite automaton with ε-moves (NFA-ε) is a further generalization to NFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #bbe556cd","location_key":"9701aa10adf35d83cd954468b677f960e91392e55168381244c389d36adba1f3","pair_key":"bebea0f59ebcc53db2f3d88ef317248f477702b00190ecb4090a78157878a0a9","passage_key":"3797c738972b6812d594bf3a7100966054cf87e11cf212a720f6311976d5a559","prominence":"central","rank":1,"section":["NFA with ε-moves"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #bbe556cd","kind":"definition","note":"Mathlib gives the transition field the domain of a state together with an optional symbol, and the absent symbol is the epsilon move.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":48,"library":"mathlib","line":40,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11812,11909],"span_sha256":"4fbd90cbc2d4b03192148bf63ad403311426ce945f4f1ce821b80ea9bef512ca"}},"location":{"quote":{"exact":"In this kind of automaton, the transition function is additionally defined on"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #39bdec98","location_key":"73bc1620dd81b0f8fe60b634bcc1d73682c0dcfea172a6f81050ef29fe4c9a7e","pair_key":"e4b516d49b9df1864622ccea3546cb4f41fcbae1eece9f12012f95d78d3f2172","passage_key":"aa87b614135f4b08c6922d8e9914f74eb91a2cb132293fc420a4901e637869c9","prominence":"supporting","rank":1,"section":["NFA with ε-moves"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #39bdec98","kind":"definition","note":"The documentation of the structure itself calls a move taken on the absent symbol an epsilon-transition, so the library names the notion the passage names.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":48,"library":"mathlib","line":40,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[11910,12044],"span_sha256":"71bea96d841c6f88b1d4109f863e1056fb7d41a9f4716bdadeec7e2203c8008a"}},"location":{"quote":{"exact":"A transition without consuming an input symbol is called an ε-transition and"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #158ac183","location_key":"50b67808c5ff562006dbada41decd4c312cff89c399213a2bb9e314ca57a5f09","pair_key":"381c95a7566e2f70b89f8e2dec608a1695b468d4f0aa5ae6e985b422ffad799f","passage_key":"c651765264a67a07d495a9fcd7636d22af3c89431d47b0e71cea0af02a3b0ddc","prominence":"central","rank":1,"section":["NFA with ε-moves","Formal definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #158ac183","kind":"definition","note":"Mathlib bundles the same five components as type parameters and fields, except that the start data is a set of states and neither the states nor the alphabet are required to be finite.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":48,"library":"mathlib","line":40,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[12551,12996],"span_sha256":"13cd3d860e079fc5a6c27b82ea530d283cac731ee19c2c33885a82d6d14fa59c"}},"location":{"quote":{"exact":"a finite set of states Q {\\displaystyle Q} a finite set of"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #837eca4f","location_key":"19de5e21d52e63a311c95ff3800898774f9b6db9f364ae1e4e60305663b7dacc","pair_key":"36e6c127acb4d802228834b4fa7e9646b688723f60b9b147a2aaa04af8d869c3","passage_key":"e30be04b1b15389770d883018dcb6876dfe362a92e69e0446c422ed32fd5919f","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Formal definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #837eca4f","kind":"notation","note":"Mathlib writes this operator with a script-P and defines it for an arbitrary set inside an arbitrary type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":255,"library":"mathlib","line":255,"path":"Mathlib/Data/Set/Defs.lean","proof_status":"definition"}},"location":{"declaration":"Set.powerset","module":"Mathlib.Data.Set.Defs"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[12997,13146],"span_sha256":"eb66e5ca959c7472cf911c20f852251e5d71ef305e26fe7a1787f8854f4b302c"}},"location":{"quote":{"exact":"Here, P ( Q ) {\\displaystyle {\\mathcal {P}}(Q)} denotes the power set","suffix":" of Q {\\displaystyle Q} a"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #7196c93c","location_key":"2dcbdd494f6cd9675b134d809be07b99c0e3cacf73da12ba768ded05273f3355","pair_key":"e5af81d8755458acc15871c55dde40b100d15fb0ccb56fecd1261ea82156a610","passage_key":"2f2434ed1cd4f034fc548f66765f28e36e128937aafc54b6ada4d04a170b26dd","prominence":"central","rank":1,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #7196c93c","kind":"definition","note":"Mathlib defines the closure of a whole set of states; the article's operator on a single state is this one at the one-element set.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":63,"library":"mathlib","line":63,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.εClosure","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[13549,13746],"span_sha256":"dda306cc1ae829b1b93cb41a695331ba7ea622ffc79bedb73054fd6cca09d97e"}},"location":{"quote":{"exact":"q 1 = q {\\displaystyle q_{1}=q} , q i + 1 ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #7196c93c","location_key":"499843b36442b6bab8ad31428cb5e0d929d48a422a81a0429e9732b831c13862","pair_key":"7f2a3d016604f75fea3042d3330ca41033d198bff7265735f5c0084ef7ff2719","passage_key":"2f2434ed1cd4f034fc548f66765f28e36e128937aafc54b6ada4d04a170b26dd","prominence":"central","rank":2,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #7196c93c","kind":"definition","note":"The run is recorded as a list of repeated absent symbols, and the traversal predicate fixes its first and last state.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":246,"library":"mathlib","line":225,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.mem_εClosure_iff_exists_path","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[13549,13746],"span_sha256":"dda306cc1ae829b1b93cb41a695331ba7ea622ffc79bedb73054fd6cca09d97e"}},"location":{"quote":{"exact":"q 1 = q {\\displaystyle q_{1}=q} , q i + 1 ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #6ff3e790","location_key":"63984d4598676a1ac50ae6c67088e04e45557a4caa01ae320307b5194396b802","pair_key":"463e1e645003a634cffcd6fbccec799a767cae76e10385773c75c10cb867a553","passage_key":"690ac3dcda048a2225ca5cf6a3da59134e8ab296b522a474c4bd6ff618fb3377","prominence":"central","rank":1,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #6ff3e790","kind":"definition","note":"Mathlib carries this operator under the epsilon-closure name and documents it as reachability by a finite run of epsilon-moves.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":63,"library":"mathlib","line":63,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.εClosure","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[13747,13850],"span_sha256":"116eed02cd0720e18b6af4a9dc1ccaf1aaee746ddb6d0fbd469aeef77d2f1013"}},"location":{"quote":{"exact":"E ( q ) {\\displaystyle E(q)} is known as the epsilon closure,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #c835e20b","location_key":"c4e634784d03e4a77262fa1d567225ed9768f8726a128336c621c5e8af8e0ff6","pair_key":"9aa305b6a47436e74f16d340080ae50f1b5617715e3e28ef3f120291fa41553d","passage_key":"b37d9f9de5b42a6a43b4009b731db4f923cca817d646cb5ad4eadba00539d467","prominence":"supporting","rank":1,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #c835e20b","kind":"definition","note":"Mathlib's operator takes an arbitrary set of states and returns those reachable from one of its members by a finite run of epsilon-moves.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":63,"library":"mathlib","line":63,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.εClosure","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[13851,14018],"span_sha256":"61ec398916b19184e64b5fbcacbe00123cf67231ebf0f05cd28ef2f39d45441f"}},"location":{"quote":{"exact":"The ε-closure of a set P {\\displaystyle P} of states of an"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #c835e20b","location_key":"824c631443c2299d4d513ff0c54f9fb7cb4a1181c146f2eebf37663e67c930b2","pair_key":"10994db2daa62ecc6c5ac6ca719260c7104ed6e465a4c2f30085223da3de2426","passage_key":"b37d9f9de5b42a6a43b4009b731db4f923cca817d646cb5ad4eadba00539d467","prominence":"supporting","rank":2,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #c835e20b","kind":"definition","note":"The library writes the union over the members of the set elementwise rather than as an equality of two sets.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":115,"library":"mathlib","line":104,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.mem_εClosure_iff_exists","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[13851,14018],"span_sha256":"61ec398916b19184e64b5fbcacbe00123cf67231ebf0f05cd28ef2f39d45441f"}},"location":{"quote":{"exact":"The ε-closure of a set P {\\displaystyle P} of states of an"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #58d21af5","location_key":"4058eda6d50d28f9948a32a3388f2b75311e2f6172aad7b1d5e4d13d422cf632","pair_key":"0d309b3b7fed49396cf1ebf0e86127cbdf3d3a754111dc54a57c6c2d212ba092","passage_key":"5805c20539add22dac0f52daa89574c07e24c64b0ba93c934c91f76e47d304c0","prominence":"supporting","rank":1,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #58d21af5","kind":"definition","note":"Mathlib lets the state type be infinite, of which the article's finite Q is one case, and marks an ε-transition by the label none instead of the letter ε.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":63,"library":"mathlib","line":63,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.εClosure","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[14019,14155],"span_sha256":"698fe951e91566d00089a2f1bab984356f31df22a9c5f4a1fd75855c96d16fbd"}},"location":{"quote":{"exact":"Formally, for P ⊆ Q {\\displaystyle P\\subseteq Q} , define E ("}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #58d21af5","location_key":"6c9a4534a1b4e7839df2ec3a57e510c4328be6049d96ba3845ef3d910752b49b","pair_key":"5ce5a276b0d5e8f9157de7fe153fae92220dde7883ad0e89a6c8a90f54d07f0b","passage_key":"5805c20539add22dac0f52daa89574c07e24c64b0ba93c934c91f76e47d304c0","prominence":"supporting","rank":2,"section":["NFA with ε-moves","ε-closure of a state or set of states"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #58d21af5","kind":"definition","note":"The equality of the two sets is phrased as a membership equivalence, and the closure of a one-element set plays the role of the article's closure of a single state.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":115,"library":"mathlib","line":104,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.mem_εClosure_iff_exists","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[14019,14155],"span_sha256":"698fe951e91566d00089a2f1bab984356f31df22a9c5f4a1fd75855c96d16fbd"}},"location":{"quote":{"exact":"Formally, for P ⊆ Q {\\displaystyle P\\subseteq Q} , define E ("}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #d6cd45b9","location_key":"2e1e40065da4bb8c2d9bc79bc2b6476685977cec3afda677fe7857a6c6d8411e","pair_key":"e76ed23fabd0bf5373cbfab13df8cfff73658c594092777c8e573fbfaa257861","passage_key":"8c7a1d6f0c2d3304c4b0e6a8431a88478ff9dc3069e85695d6c082845b2481f6","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Extended transition function"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #d6cd45b9","kind":"notation","note":"Mathlib starts the computation from a set of states rather than one state and allows infinitely many states, and strings are lists of alphabet letters.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":136,"library":"mathlib","line":135,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.evalFrom","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[14307,14545],"span_sha256":"1eb91e9d21a5225a2e9ede62f1ef02801d8a3ffe198e9d5370686500237803ac"}},"location":{"quote":{"exact":"Informally, δ ∗ ( q , w ) {\\displaystyle \\delta ^{*}(q,w)} denotes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #79d12e2e","location_key":"5ccf03f1a18c6c4755fed8c8ec8ed3c84b10f2d91a59bc99672e82e72887c8c3","pair_key":"458660dac0c61c204afc3f3516d3b356949d5c84f8d090595e7aeab4bf0ca3fd","passage_key":"c7839f26bb7ca12b48f440e0f6bc5421fc4b9e7276b8f779822d9d08a441ef4a","prominence":"central","rank":1,"section":["NFA with ε-moves","Extended transition function"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #79d12e2e","kind":"definition","note":"Mathlib states the base case for a whole set of starting states, and the empty string is the empty list of letters.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":140,"library":"mathlib","line":139,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.evalFrom_nil","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[14699,14879],"span_sha256":"ff6b2a6ec088ef76e709a15f7026969200134e6be2adac20781fe266bbac86e1"}},"location":{"quote":{"exact":"δ ∗ ( q , ε ) = E ( q )"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #ffdfb67b","location_key":"499176ee803ed7c93d390ddd4dd19ffc084b08f60197951c359f8b1505e84f1c","pair_key":"0a1e8c476e7db640ae86ca5cb340a3ded1746083bcd65fe141597a5592bec7de","passage_key":"f3c714dcf4367323669fdb205731a3225c633278ff3f025d6974e1e0f1c74e98","prominence":"central","rank":1,"section":["NFA with ε-moves","Extended transition function"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ffdfb67b","kind":"definition","note":"Mathlib writes the union through its one-letter step operation on sets and encodes reading the letter a as the labelled option some a.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":149,"library":"mathlib","line":147,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.evalFrom_append_singleton","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[15034,15325],"span_sha256":"fa95e833c878f1eba59c3640c3a7b903ce50b34c7dd981b3752d963a685906a5"}},"location":{"quote":{"exact":"δ ∗ ( q , w a ) = ⋃ r ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #ffdfb67b","location_key":"ba4e3e67744c229e331302695602a8cdebbb722bcaa5a20d2dbb0e9e05576f60","pair_key":"12dedac51ff55673e6a242356f89feb29b04187bf9dee03c48f959f2174a0175","passage_key":"f3c714dcf4367323669fdb205731a3225c633278ff3f025d6974e1e0f1c74e98","prominence":"central","rank":2,"section":["NFA with ε-moves","Extended transition function"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ffdfb67b","kind":"definition","note":"This is the operation whose definition supplies the union of ε-closures appearing on the right of the passage's equation, but on its own it says nothing about evaluating a string.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":119,"library":"mathlib","line":118,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.stepSet","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[15034,15325],"span_sha256":"fa95e833c878f1eba59c3640c3a7b903ce50b34c7dd981b3752d963a685906a5"}},"location":{"quote":{"exact":"δ ∗ ( q , w a ) = ⋃ r ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #fd951c76","location_key":"aea3ef9cb6f41741219fc3a3893c9b1142e6270e50a2f399bb816c4181f31d9d","pair_key":"58d27555fa2887adb79a7e659bcc1f18b6ef02dec380a31bb642339cb0e552ba","passage_key":"375fdcdb0a51b90d9f025260f1d1d5d700e398dd5d183b6181705552533b548c","prominence":"central","rank":1,"section":["NFA with ε-moves","Extended transition function"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #fd951c76","kind":"definition","note":"Mathlib collects the accepted inputs into a language of lists and lets the automaton carry a set of initial states; asking for an accepting state in the reached set is the same as asking that the reached set meet the accepting ones.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":184,"library":"mathlib","line":183,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.accepts","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[15718,16027],"span_sha256":"fbf3db82a38971c0b0a0a5d97c18403b26b8146b495ddf355e8ccdbb4fff696d"}},"location":{"quote":{"exact":"The automaton is said to accept a string w {\\displaystyle w} if"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #8256cf81","passage_key":"6e0281f423b78c2bf941b8b4f3f14191bff33c9d4dd969bd8d4c3737ed5ee1ff","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"d1a3502277e126785c8435da1576de5d6cc057a0122fda59be9e71a9c361eb3d"},"section":["NFA with ε-moves","Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #8256cf81","kind":"example","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[16065,16208],"span_sha256":"bfdae773939a5dea2027ca05008454d54fdf9ab93fe7101c939f7304b0284734"}},"location":{"quote":{"exact":"Let M {\\displaystyle M} be a NFA-ε, with a binary alphabet, that"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #6c114d8a","location_key":"c33fc5f8cb110d409e8f077cb2ef4687a7a8d6ddb94cceefa01ee95b2ba65007","pair_key":"e6b2cc752f9f2e08ac5e59ecd438ae7e0143955a8c2a81748b7eef84f50a97fa","passage_key":"b9fe9702804b3af843c1f1e5a64fef6df8a5f28e93dd6ea8f49df2f35c398b34","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #6c114d8a","kind":"theorem","note":"Mathlib states this for any type with addition and a zero, of which the counts of occurrences are one case, and being even there means being the sum of something with itself.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":104,"library":"mathlib","line":104,"path":"Mathlib/Algebra/Group/Even.lean","proof_status":"proved"}},"location":{"declaration":"Even.zero","module":"Mathlib.Algebra.Group.Even"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[16209,16274],"span_sha256":"6c114d8ad9c2bb601dd5e5aece7580e498685a7deb72d2fbd60273f60d33bc34"}},"location":{"quote":{"exact":"Note that 0 occurrences is an even number of occurrences as well."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #522b085f","passage_key":"25022a1c4b70d5c8b696282993a7d5cceabc447a9c9ef52d71e1035ce0825219","prominence":"supporting","receipt":{"candidates":3,"queries":3,"sha256":"97a8cd77ce9c675362a615008f4e835d96f009f6ff042195901ce235e602b58d"},"section":["NFA with ε-moves","Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #522b085f","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[16671,16866],"span_sha256":"cd65fae95728ab1ec89f7717607f37941e5fb0b57a05cf9a53953a8067b737ba"}},"location":{"quote":{"exact":"M {\\displaystyle M} can be viewed as the union of two DFAs:"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #515dc09f","passage_key":"5b269384eabbb5452dd2d2fde92e33f9fed94763ef74e8d1f6fe3276a8911c23","prominence":"supporting","receipt":{"candidates":3,"queries":5,"sha256":"219a34231fb431e02738aedc019c7336c85a372db9358b4b7fc7bda610fafaee"},"section":["NFA with ε-moves","Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #515dc09f","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[16867,17088],"span_sha256":"7c9bbf3eb23fc2e67740f1d22e8b3c72f1742e7b77a9544388473dfb614013a5"}},"location":{"quote":{"exact":"The language of M {\\displaystyle M} can be described by the regular"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #e36bcdea","location_key":"e01d6a0050fe536a581b7e7ecb7f35551da2ee0830ebb7c031e6991ec748445d","pair_key":"a928ecdb6c6f28b08a490f24417364bf49b05f4ae48ce0a10183170125e39de0","passage_key":"8158f948e75baaae86a00bdd83f495814698149e3c1e11fa4d3da49c3aa27190","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #e36bcdea","kind":"theorem","note":"The ε-free automaton the lemma produces is Lean's own conversion, so the machine it exhibits need not be the one a reader would draw by hand.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":313,"library":"mathlib","line":312,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.toNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[17089,17194],"span_sha256":"e4842f2a3867e573d0c47a623fe0c84817503662cee6b46e8d70af6661e233a2"}},"location":{"quote":{"exact":"We define M {\\displaystyle M} using ε-moves but M {\\displaystyle M} can"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #e36bcdea","location_key":"986fc327f904faff1a0799a9b32f8a5675c794d23f2268dd13031ad2d536c0f7","pair_key":"890ea2b30a3bc0e21c23af72d59b0ce196d96c51d8fc7ae2e725bf4d2c677c9e","passage_key":"8158f948e75baaae86a00bdd83f495814698149e3c1e11fa4d3da49c3aa27190","prominence":"supporting","rank":2,"section":["NFA with ε-moves","Example"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #e36bcdea","kind":"theorem","note":"This is the conversion that removes the ε-steps; on its own it asserts nothing about the language of the machine it builds.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":304,"library":"mathlib","line":301,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.toNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[17089,17194],"span_sha256":"e4842f2a3867e573d0c47a623fe0c84817503662cee6b46e8d70af6661e233a2"}},"location":{"quote":{"exact":"We define M {\\displaystyle M} using ε-moves but M {\\displaystyle M} can"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #87171aed","location_key":"aa28077a159a21617746e6e13df32165c74d0b9f40034740685291751d375313","pair_key":"f5c3d48a751263e25338b43b535e64ad113d4c3a9fb8acb3858fc5eba723e13a","passage_key":"321f2915100edf6341f95be0bd39416d5acff5d84b9326b1f6bb0469c26b1fbb","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #87171aed","kind":"theorem","note":"Lean keeps the two kinds of automaton as distinct types, so the inclusion is encoded as a conversion that reuses the states, the start and accept sets and the transitions and adds no ε-step, and the lemma records that the accepted language is unchanged.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":352,"library":"mathlib","line":350,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toεNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[17214,17296],"span_sha256":"4c7f513e179a99f7268bfea95a668ef586e6c9faacad743e707c18dc5581429f"}},"location":{"quote":{"exact":"To show NFA-ε is equivalent to NFA, first note that NFA is"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #87171aed","location_key":"d043fcf2f8b0a5e329672735ede54357844122670dade2af6cf95b6a11f31253","pair_key":"3a044503fc28a09a340bb6481c569a24e8e95c7eccc57b130ec9f3129268f16d","passage_key":"321f2915100edf6341f95be0bd39416d5acff5d84b9326b1f6bb0469c26b1fbb","prominence":"supporting","rank":2,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #87171aed","kind":"theorem","note":"The conversion by itself, documented as reusing the start and accept states and the transitions, but stating nothing about languages.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":330,"library":"mathlib","line":327,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.toεNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[17214,17296],"span_sha256":"4c7f513e179a99f7268bfea95a668ef586e6c9faacad743e707c18dc5581429f"}},"location":{"quote":{"exact":"To show NFA-ε is equivalent to NFA, first note that NFA is"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #ec23ca28","location_key":"2e90011fdbd2dc63d47db420ddfe776006dd488dad3d6aa907c99482556b3e2a","pair_key":"06ecfae4dcf07d371e137f1732e26038396ee1ab12c02a6d2270ece75906a536","passage_key":"34f52d73fa68080d2bef68fe3184c7f1c8364b35e16bcd9ce5a7fc0102fc33b8","prominence":"central","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ec23ca28","kind":"construction","note":"Lean's conversion builds an ε-free automaton from one with ε-moves, but not by the passage's two equations: because its automata carry a set of start states it closes that set under ε-steps and leaves the accepting states alone, instead of adding the start state to them.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":304,"library":"mathlib","line":301,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"definition"}},"location":{"declaration":"εNFA.toNFA","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[17369,18027],"span_sha256":"07de80b9a3961f662f00b631f33788b713a676b6001b04570950761407457d01"}},"location":{"quote":{"exact":"Given an NFA with epsilon moves M = ( Q , Σ"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #ec23ca28","passage_key":"34f52d73fa68080d2bef68fe3184c7f1c8364b35e16bcd9ce5a7fc0102fc33b8","prominence":"central","receipt":{"candidates":3,"queries":3,"sha256":"49224640f750f292a879eb520dec9cf7b07c54923e54d7c580ba6f499934becc"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ec23ca28","kind":"construction","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[17369,18027],"span_sha256":"07de80b9a3961f662f00b631f33788b713a676b6001b04570950761407457d01"}},"location":{"quote":{"exact":"Given an NFA with epsilon moves M = ( Q , Σ"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #a401c727","passage_key":"9ec371ee9ddfcd3fa2cede2165df0cb8e633aeecbb847b19b5c8976adf2d2451","prominence":"supporting","receipt":{"candidates":3,"queries":3,"sha256":"e913751997e7da96553262eb9c8cdc2a9321f68b1e0bb90a0e71290908cb414f"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a401c727","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[18317,18378],"span_sha256":"55a411c2ceeb3ced3ebb21593d2ba45f8a9c2426143d669ef42a4c92350d64d0"}},"location":{"quote":{"exact":"By construction, M ′ {\\displaystyle M'} has no ε-transitions."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #56a12efa","location_key":"a88bc79679975de9535c6211547e5ac1bf3f28b426ba9e1f9d83fed1edd9c44d","pair_key":"951f25c39ded54470b45f623014231092490de4b34cb939588fb6cd411dc399b","passage_key":"866be2fd092649ec45f1f2ff58bca176e7f86b636b4917cb48ebd85a26442796","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #56a12efa","kind":"theorem","note":"It matches the evaluations of Lean's converted machine and the original one, but only after the ε-closure is applied to the start set, and for a conversion whose transitions differ from the passage's.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":309,"library":"mathlib","line":307,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.toNFA_evalFrom_match","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[18379,18604],"span_sha256":"df7c0a3683569a9d6156a2a80289525653968f43f4338b1bceddb616ef2b7426"}},"location":{"quote":{"exact":"One can prove that δ ′ ∗ ( q 0 , w"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #56a12efa","passage_key":"866be2fd092649ec45f1f2ff58bca176e7f86b636b4917cb48ebd85a26442796","prominence":"supporting","receipt":{"candidates":3,"queries":3,"sha256":"f23c0b017883f2ed3ba81f406d6086856674c68fc4e66152da9a6e65b511a890"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #56a12efa","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[18379,18604],"span_sha256":"df7c0a3683569a9d6156a2a80289525653968f43f4338b1bceddb616ef2b7426"}},"location":{"quote":{"exact":"One can prove that δ ′ ∗ ( q 0 , w"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #2b75f1f1","location_key":"1853550c8ff68ca57900ac748eb7e6d55d74e5893a5b6ec2804de29a4b46b44f","pair_key":"7251b257c2e8d8622f60e30ef7e4afd4ee7ef60de4462f74477b7d5e503be8b4","passage_key":"c6d61bd3bb3d12cbaaeb8be5079939a6ebde74d3d0c9683275d8123f73b1b787","prominence":"central","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #2b75f1f1","kind":"theorem","note":"The universe does prove that removing ε-steps preserves the accepted language, but for its own conversion, whose start set is ε-closed and whose accepting states are untouched, so it is a statement about another machine than the one the passage built.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":313,"library":"mathlib","line":312,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.toNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[18605,18879],"span_sha256":"b71a4603903a7df7eb31e0fb9c4485052c6fc6af15f7ff67550c20acaeba8d1d"}},"location":{"quote":{"exact":"Based on this, one can show that δ ′ ∗ ( q"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #2b75f1f1","passage_key":"c6d61bd3bb3d12cbaaeb8be5079939a6ebde74d3d0c9683275d8123f73b1b787","prominence":"central","receipt":{"candidates":3,"queries":3,"sha256":"23be13ea74a50a11c1e2c10ceb37221709f72a776c9aa59739cf2b0ecfd269bd"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #2b75f1f1","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[18605,18879],"span_sha256":"b71a4603903a7df7eb31e0fb9c4485052c6fc6af15f7ff67550c20acaeba8d1d"}},"location":{"quote":{"exact":"Based on this, one can show that δ ′ ∗ ( q"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #a5345929","passage_key":"296f5993102e49e76b2962a36ab3b2a6c62904d082db7c35f4a8195c93fdd06e","prominence":"supporting","receipt":{"candidates":3,"queries":3,"sha256":"c2ce124a9751886bafb44266b862d42e61368d0ed33c36da717230a7cb5a08dd"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a5345929","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[19117,19434],"span_sha256":"bda572ee218d931c6123bce4e6127531dfa12fd5519bdd11965f6f1d6197f0e9"}},"location":{"quote":{"exact":"From δ ′ ∗ ( q 0 , w ) = δ"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #a70b6f0f","location_key":"9c8f122281c783cb63a83558d99ce5c565608a5de5bc61bdf0a03d6fce7006dd","pair_key":"20831d89800fe6770835292fdd39a6a873f766d838e0eb16d1a2ee8f970dbd23","passage_key":"3066621928b2c5a23a86b90a5f6714b992a8db4360182bdc34a3a26b5e7489c6","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a70b6f0f","kind":"theorem","note":"Mathlib converts an automaton with epsilon-moves by taking the epsilon closure of the start set and keeping the accepting set, so it never speaks of the article's enlarged accepting set.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":309,"library":"mathlib","line":307,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.toNFA_evalFrom_match","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[19507,19759],"span_sha256":"2d41e412ecf5ee91e2f57a67235c7309021700746724889fe19f71f0d44f8363"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":"n. "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #a70b6f0f","location_key":"629b4d9e74a9f0e3a7a9e56956868bf8dec8e6ca23ce62858d37ee3cc12c5608","pair_key":"83965facfcf6fbce6e749bfba69bea5b38fc81fce16e49bd60eb333c7d79f14c","passage_key":"3066621928b2c5a23a86b90a5f6714b992a8db4360182bdc34a3a26b5e7489c6","prominence":"supporting","rank":2,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a70b6f0f","kind":"theorem","note":"This is the whole correctness statement of a different conversion, not the article's case analysis on where an accepting state of the new automaton came from.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":313,"library":"mathlib","line":312,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.toNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[19507,19759],"span_sha256":"2d41e412ecf5ee91e2f57a67235c7309021700746724889fe19f71f0d44f8363"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":"n. "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #a70b6f0f","passage_key":"3066621928b2c5a23a86b90a5f6714b992a8db4360182bdc34a3a26b5e7489c6","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"4985b5fead19d732592d379eec882ba74d71fe0ffbd0c8ab056600888d5655c8"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a70b6f0f","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[19507,19759],"span_sha256":"2d41e412ecf5ee91e2f57a67235c7309021700746724889fe19f71f0d44f8363"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":"n. "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #5b8b9ff6","location_key":"dd3219ffe8500ee8773d375c173bb23ae21b3531e89ad6eac458caa6daa1481a","pair_key":"bc15778879469547cbbb67649eaa5761d10441e42787289958913413fb21c4cf","passage_key":"bf91b34c25350fcbe28649c5c8d180b8d8bf2fa615a8a34794a5aa94f0e61a66","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5b8b9ff6","kind":"theorem","note":"It only records that a set of states is contained in its own epsilon closure, which is a background fact rather than the passage's conditional claim.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":65,"library":"mathlib","line":65,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.subset_εClosure","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[19760,20038],"span_sha256":"bb38c822165c3318d866a9c3b2b5632c6c657e22e451e3a835cc615c95343db4"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":" . "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #5b8b9ff6","passage_key":"bf91b34c25350fcbe28649c5c8d180b8d8bf2fa615a8a34794a5aa94f0e61a66","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"f15251ce4cdbb875e8e903bfc8330a1f0090bc57006e1e9e0b891a9e07bc540d"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #5b8b9ff6","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[19760,20038],"span_sha256":"bb38c822165c3318d866a9c3b2b5632c6c657e22e451e3a835cc615c95343db4"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":" . "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #df0599a2","location_key":"4769b772b75776e7564fa7ed9d3a6a7187f8437353a1487354fc372a0d48db97","pair_key":"414ea9c789d76ea56ba86df9dcabb10df0327011542ce0f05ebac7d90cf5f290","passage_key":"ee807e1e23eeb31a2f3eeefa3a2409c521a01cf737b59cc5b056822557ec79a7","prominence":"supporting","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #df0599a2","kind":"theorem","note":"It computes the set reached on the empty word as the epsilon closure of the start set, which is the object the first conjunct mentions but not the claim made about it.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":172,"library":"mathlib","line":171,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.eval_nil","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[20039,20474],"span_sha256":"dfc78b6ffac84aaff86a7ffe36cc318eb02b15be2f66ca516b52098a6f24fdd0"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":"} "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #df0599a2","passage_key":"ee807e1e23eeb31a2f3eeefa3a2409c521a01cf737b59cc5b056822557ec79a7","prominence":"supporting","receipt":{"candidates":3,"queries":3,"sha256":"1d198b10aee948df2e2a68105b190cd161f04b890e4e246d71cf252b8b51bed2"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #df0599a2","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[20039,20474],"span_sha256":"dfc78b6ffac84aaff86a7ffe36cc318eb02b15be2f66ca516b52098a6f24fdd0"}},"location":{"quote":{"exact":"If δ ′ ∗ ( q 0 , w ) {\\displaystyle \\delta","prefix":"} "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #3e0f5319","location_key":"46faecb2f218cd45efe939e05585d925fbfb65e44b408414a37590eaa300655d","pair_key":"03f5e3174b3a8e5386f0266f5afeb50408499aa730a8e99457ff27a66ebb9053","passage_key":"71019ddbb9233649a6d1bc5e4abbcd1b23588f1e81e6d369a979fe68336eac4e","prominence":"central","rank":1,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3e0f5319","kind":"theorem","note":"The declaration lands in the epsilon-free model; the index ties that model to the deterministic one by its own pair of conversion theorems, which I read as two presentations of the recognizable languages rather than as a further hypothesis.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":313,"library":"mathlib","line":312,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"εNFA.toNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[20512,20544],"span_sha256":"28a7c64ee8fc6356225cea94582de6063208c615de96e7c4cc5db7f93e4f39d2"}},"location":{"quote":{"exact":"NFA-ε is also equivalent to DFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #3e0f5319","location_key":"b40461e2ed3e72303d4a2f84423ac87df2d98c496b419da16e31638749069d5b","pair_key":"37aaa5362a45527aca7c1764ee9939a397fcdeedcd8dc67b967e2f0da8a8e2f0","passage_key":"71019ddbb9233649a6d1bc5e4abbcd1b23588f1e81e6d369a979fe68336eac4e","prominence":"central","rank":2,"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3e0f5319","kind":"theorem","note":"It supplies the easy inclusion of the equivalence, the one the article disposes of by calling the smaller model a special case of the larger.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":352,"library":"mathlib","line":350,"path":"Mathlib/Computability/EpsilonNFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toεNFA_correct","module":"Mathlib.Computability.EpsilonNFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[20512,20544],"span_sha256":"28a7c64ee8fc6356225cea94582de6063208c615de96e7c4cc5db7f93e4f39d2"}},"location":{"quote":{"exact":"NFA-ε is also equivalent to DFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #3e0f5319","passage_key":"71019ddbb9233649a6d1bc5e4abbcd1b23588f1e81e6d369a979fe68336eac4e","prominence":"central","receipt":{"candidates":0,"queries":3,"sha256":"57eb0efc7df6359333e57036915dacc303bfbfd40dc49157bd269507bb951a1b"},"section":["NFA with ε-moves","Equivalence to NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3e0f5319","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[20512,20544],"span_sha256":"28a7c64ee8fc6356225cea94582de6063208c615de96e7c4cc5db7f93e4f39d2"}},"location":{"quote":{"exact":"NFA-ε is also equivalent to DFA."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #a1778adf","location_key":"47726ec03bd582f24d11404112a3d5a97eb2fa19a121c4c7ac32bf1f32573e17","pair_key":"4f66decac9aa45018db821718266e046dd44304616fcb75ddeb9e7b50d14da08","passage_key":"8cb7b9126e4dee51c507bdf9a4778399230bda37508deff69076c4c58e3df02e","prominence":"central","rank":1,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a1778adf","kind":"theorem","note":"Mathlib puts no finiteness demand on the state type, so the finiteness the regular-language predicate wants comes from the passage's own automaton.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21388,21469],"span_sha256":"e02b84c94a95ad4da0869e44607d98da8794e092070985d2b98f12ba838038e0"}},"location":{"quote":{"exact":"They can also be used to prove that NFAs recognize exactly the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #a1778adf","location_key":"1d8839b32b85f0ea096ad919c85171b982d4a9b8030f252554133716d6451479","pair_key":"ce67faa1534001d78df553d699905c108d0d9468092899a6a9593d32a383ab3a","passage_key":"8cb7b9126e4dee51c507bdf9a4778399230bda37508deff69076c4c58e3df02e","prominence":"central","rank":2,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #a1778adf","kind":"theorem","note":"The converted automaton keeps the state set, so the finiteness the passage expects of an automaton is preserved.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":354,"library":"mathlib","line":348,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.toNFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21388,21469],"span_sha256":"e02b84c94a95ad4da0869e44607d98da8794e092070985d2b98f12ba838038e0"}},"location":{"quote":{"exact":"They can also be used to prove that NFAs recognize exactly the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #94a72f6c","location_key":"203ab2bbfd7049e7270e27db534f06de9de9f8da1b1f3044d2cee4c395f6cd0f","pair_key":"5387021dab4afe7c7ad2a878a40d561d1a21e84441e86032334d4ddef2a85420","passage_key":"53b9fc7bb1e481117ed703719e04b8390c4900c3ea3e72d3a1507738cded8e42","prominence":"central","rank":1,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #94a72f6c","kind":"theorem","note":"Mathlib phrases the closure with its recognizability predicate, whose witness is a finite deterministic machine, and the index links that model to the nondeterministic one by its two conversion theorems; the sum of two languages is their union.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":394,"library":"mathlib","line":390,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"Language.IsRegular.add","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21470,21631],"span_sha256":"b7baa4564386ed1192fc11f9616694ebf5d920b52c9a8e2c634364892380f8de"}},"location":{"quote":{"exact":"Union (cf. picture); that is, if the language L1 is accepted by"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #c330c410","location_key":"bc4df89185c4950804428d87efcea0c992549fb27bfdec8b6b08233ce80fff75","pair_key":"cb48ccc03bdf6f30e18d55325d2543996ec1a6f68e1050765e6ce374035ac8ae","passage_key":"44a0aaec73a5602b4e8ef8d77903c81b80940e39b0a9857dbc84ac62b774d731","prominence":"central","rank":1,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #c330c410","kind":"theorem","note":"Mathlib phrases the closure with its recognizability predicate, whose witness is a finite deterministic machine, and the index links that model to the nondeterministic one by its two conversion theorems; the meet of two languages is their intersection.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":401,"library":"mathlib","line":397,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"Language.IsRegular.inf","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21632,21720],"span_sha256":"0c7786b4ab601fe513e063984467ff3e7f64e5dcb26aa5261794a4a0196c2a2b"}},"location":{"quote":{"exact":"Intersection; similarly, from A1 and A2 an NFA Ai can be constructed"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #7ce89f9b","location_key":"33d769b637e45ff8506962758578c89c13afae0c9412555cca753fa7e1a1a79d","pair_key":"37d8590954240f99d7a0b194d8d6fe4c4024410cd97bede400172184fadf4e00","passage_key":"4a8e11d7b800abae9b04966dacbafcc942177ecd88f753f250fcb3ecdec0b3cb","prominence":"central","rank":1,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #7ce89f9b","kind":"theorem","note":"It gives concatenation closure for the languages denoted by regular expressions, and this universe holds no theorem connecting that class to the automaton-recognizable one.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":120,"library":"mathlib","line":119,"path":"Mathlib/Computability/RegularExpressions.lean","proof_status":"proved"}},"location":{"declaration":"RegularExpression.matches'_mul","module":"Mathlib.Computability.RegularExpressions"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21721,21734],"span_sha256":"ed2d1646eccb3acac1276cac590d51c4833852d2e557bc2c1c6329be7832d795"}},"location":{"quote":{"exact":"Concatenation"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #7ce89f9b","passage_key":"4a8e11d7b800abae9b04966dacbafcc942177ecd88f753f250fcb3ecdec0b3cb","prominence":"central","receipt":{"candidates":4,"queries":4,"sha256":"bdb15dc55183eb2ee55576b8ddb5e9025e8ad367f40721ce5c99c54a5fbc1a5d"},"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #7ce89f9b","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21721,21734],"span_sha256":"ed2d1646eccb3acac1276cac590d51c4833852d2e557bc2c1c6329be7832d795"}},"location":{"quote":{"exact":"Concatenation"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #ea259aef","location_key":"c6d2b0a862c0351f0130d22a125babe1e2fb3b7742cebbe3bf35bb50f5c8925a","pair_key":"ca60234ae1ce21a31ee285a4ebba1d42d3fda7914516d16ffcc90ac3ef43761f","passage_key":"9c349a5dda4fa901e0f6a18d8d0a3823027fc8eae153be486859955d56d63483","prominence":"central","rank":1,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ea259aef","kind":"theorem","note":"Mathlib carries out the complementation only for deterministic machines, which are the deterministic cases of the article's A1, and its complement is taken inside the set of all strings over the alphabet.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":288,"library":"mathlib","line":287,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.accepts_compl","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21735,21812],"span_sha256":"be72be22380d72b63f5477194f776a9a986d3fc7eeb255256b0c979ef58fc13c"}},"location":{"quote":{"exact":"Negation; similarly, from A1 an NFA An can be constructed that accepts"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #ea259aef","location_key":"ad7220b39e3fe4ee6b6444a2223eba460f8c7ad782eb5311b0f7f0432e0bd2a1","pair_key":"15e7a6bf0a2aaefc1840a817b542311db87f9b101fd8851829760c6fd08951e2","passage_key":"9c349a5dda4fa901e0f6a18d8d0a3823027fc8eae153be486859955d56d63483","prominence":"central","rank":2,"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ea259aef","kind":"theorem","note":"Closure under complement is stated for languages defined by a finite deterministic machine, so carrying it to the article's nondeterministic machines needs the subset construction in both directions.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":378,"library":"mathlib","line":376,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"Language.IsRegular.compl","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21735,21812],"span_sha256":"be72be22380d72b63f5477194f776a9a986d3fc7eeb255256b0c979ef58fc13c"}},"location":{"quote":{"exact":"Negation; similarly, from A1 an NFA An can be constructed that accepts"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #edb25e4e","passage_key":"74fd07c53dbd400a5a8feb2632053294d5b69c7bbf1cf71fe11525939c844be5","prominence":"central","receipt":{"candidates":4,"queries":4,"sha256":"21c405dcec3a222618e1cfd166c2f07919221c6b3955c238d2315623a2d7894b"},"section":["Closure properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #edb25e4e","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[21813,21827],"span_sha256":"ee0c90d0e96722294c0c2efc9634bc2013b29efc4dbb67176d26cefc70325833"}},"location":{"quote":{"exact":"Kleene closure"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #9308e26c","location_key":"7948e8dbc313cf39f22c04fb7643731aa623cb57a302d666cef1a49e0f76092d","pair_key":"d208bf248be527ee4b502bc6de65740e9464a370bf165dfb45e583dff5fbfdf6","passage_key":"2dbc726b9277cc9bbe5cf0a82655cae918b6e09e7f458e31eaf0328e96a431fe","prominence":"supporting","rank":1,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #9308e26c","kind":"definition","note":"Lean reads being in an accepting state at the end as the evaluated set of reachable states meeting the set of accepting states, and allows an arbitrary state type where the article keeps a finite one.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":256,"library":"mathlib","line":255,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.mem_accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22487,22641],"span_sha256":"ddbcdb0b435fcadd2991e3ab558e1f5b49686557e2d71adf9bf0ab9221acf3b4"}},"location":{"quote":{"exact":"If, when the automaton has finished reading, it is in an accepting"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #9308e26c","location_key":"03c81913f7437b28531495d4eb0e028878821a7607c774f82bfc9de13a62287c","pair_key":"f6c57827791bf5e17d809cc06858a3571a52b0a1a11801611a349dcb286fbbee","passage_key":"2dbc726b9277cc9bbe5cf0a82655cae918b6e09e7f458e31eaf0328e96a431fe","prominence":"supporting","rank":2,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #9308e26c","kind":"definition","note":"This is the defined object behind the acceptance rule, given for an arbitrary state type and so for more machines than the article's finite ones.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":253,"library":"mathlib","line":253,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22487,22641],"span_sha256":"ddbcdb0b435fcadd2991e3ab558e1f5b49686557e2d71adf9bf0ab9221acf3b4"}},"location":{"quote":{"exact":"If, when the automaton has finished reading, it is in an accepting"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #848a61c6","location_key":"c98804e6d3cc3a2515e8531e4abd98245f957708817c6bcda167681e398404ab","pair_key":"a3e64e927a4f6bba07c741c00e56046d63a755966bddbe5be738d31f7aeb0a3d","passage_key":"f8ebfea17834cebf340706263d78aa83e49830a1d61ca9f305c55f324445daab","prominence":"supporting","rank":1,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #848a61c6","kind":"definition","note":"Lean packages the collection as a language over the alphabet and allows any state type, which covers more machines than the article's finite ones.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":253,"library":"mathlib","line":253,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.accepts","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22642,22716],"span_sha256":"1d1951fd8e7bb1ef9cb38a5dd8e14a6c0c7413bf3d027399a899d825abac86d8"}},"location":{"quote":{"exact":"The set of all strings accepted by an NFA is the language"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #3105ee88","location_key":"4ed4627220bcbe6c52be61d83f8cb94844346f7eb6facf3dc2b2acceffdcf54d","pair_key":"dc9a765c7e94c44c95e45681f3b1b487020afe03b0c3ff073e797aa6b9c111e7","passage_key":"e922c610cf95df176788131e7ab8b60e0940bccaf0a89eb715ec796a17c6d803","prominence":"supporting","rank":1,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3105ee88","kind":"theorem","note":"Mathlib states the subset construction for an arbitrary state type and leaves the step to the word regular to the definition of a regular language, which asks exactly for a deterministic machine with finitely many states.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22717,22753],"span_sha256":"726e868008ca36569299190b36f7b177125374e5ecc94b57c7ca5580cabc6311"}},"location":{"quote":{"exact":"This language is a regular language."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #3105ee88","location_key":"45040fa5dbb502fe829b414269fe188dfbccf540a511ac9299a9d28d9427fa94","pair_key":"22b4c55e7f51765537cb7428fb43436352368e3d8caba798295893eb0bc0f226","passage_key":"e922c610cf95df176788131e7ab8b60e0940bccaf0a89eb715ec796a17c6d803","prominence":"supporting","rank":2,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #3105ee88","kind":"theorem","note":"It fixes what being regular means, a finite-stated deterministic machine accepting the language, but says nothing about machines that are nondeterministic.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":374,"library":"mathlib","line":372,"path":"Mathlib/Computability/DFA.lean","proof_status":"proved"}},"location":{"declaration":"Language.isRegular_iff","module":"Mathlib.Computability.DFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22717,22753],"span_sha256":"726e868008ca36569299190b36f7b177125374e5ecc94b57c7ca5580cabc6311"}},"location":{"quote":{"exact":"This language is a regular language."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #6aa08ab3","location_key":"85b8db2656068b64258a9ab32aef59891ddc4e20677efadffd8376dbef781299","pair_key":"69df436e9f5397fc89efab1b689e2eb6e2bde7b1d9040216fec6b01ec933b2a4","passage_key":"7eab5323a3b281c021eed506a6ffa4627b259d0bd52d2d98460807db775dacea","prominence":"supporting","rank":1,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #6aa08ab3","kind":"theorem","note":"Mathlib names the deterministic machine instead of merely asserting that one can be found, and states it for an arbitrary state type, so it covers more machines than the article's finite ones.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22754,22851],"span_sha256":"6985c1196cb63c19025d259955304a82dca7f80a762e28f30e247d2b473a9dbc"}},"location":{"quote":{"exact":"For every NFA a deterministic finite automaton (DFA) can be found that"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #6aa08ab3","location_key":"a3ba7a2bab358af831e7b98630c5698f7fa0772d6f2e95a01331e5c8a9a5a946","pair_key":"611df3a336da4c135dc9ea599d306e36f1adfba5020f16f00bd51ec9dcdc6066","passage_key":"7eab5323a3b281c021eed506a6ffa4627b259d0bd52d2d98460807db775dacea","prominence":"supporting","rank":2,"section":["Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #6aa08ab3","kind":"theorem","note":"It is the subset construction itself, data rather than a claim, and on its own says nothing about the language of the machine it builds.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":309,"library":"mathlib","line":306,"path":"Mathlib/Computability/NFA.lean","proof_status":"definition"}},"location":{"declaration":"NFA.toDFA","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[22754,22851],"span_sha256":"6985c1196cb63c19025d259955304a82dca7f80a762e28f30e247d2b473a9dbc"}},"location":{"quote":{"exact":"For every NFA a deterministic finite automaton (DFA) can be found that"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #59b1c947","passage_key":"ca22f14035db9ef142e36a92af1a0812ac22ba632f58281fa7ab0e5a654726a3","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"71f85982832df00e61e1617a5557658704c42161e4c223e6b18caddea0752c5e"},"section":["Implementation"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #59b1c947","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[23667,23754],"span_sha256":"f900a4027b3e9a7938bed8df6fddf2e139fec92044668c729573ab2f205d2dca"}},"location":{"quote":{"exact":"Each step requires at most s2 computations, where s is the number"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #0a0c162f","passage_key":"cb73b214cc679f79154b03e2c122d5f0a3cb7523e772f218b3f448a2628e88fe","prominence":"supporting","receipt":{"candidates":4,"queries":4,"sha256":"0be8a2631afdcf90cc35a564f438bf7ca8b2f1d2ac76bccdb6eaad05346be3dc"},"section":["Implementation"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #0a0c162f","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[23879,23952],"span_sha256":"edd1e4301d7d2ee6aef73e81ad31d0a955791fe641378acbab88765c2e5d16fc"}},"location":{"quote":{"exact":"A string of length n can be processed in time O(ns2),[15] and"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #f9a7462f","passage_key":"59f7529510b596128f00802b13a8f507a69c2c7ff913fe0c6df413b245863a16","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"c538c3b2ac38e8ea2157c6ea7b797fc5d472b3cbdedb59db5d930db4b14f3782"},"section":["Implementation"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #f9a7462f","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[24204,24331],"span_sha256":"b7e954ea74f514236a6cf4ac27b3384081857e9556ba9bb1cb50a2dc1a06a3b8"}},"location":{"quote":{"exact":"(This, too, requires linear storage with respect to the number of NFA"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #fdbb1154","passage_key":"34bb4e6004541c8def2e232df17b5b1bf1602982ec58420dd426b4fb541deeb4","prominence":"central","receipt":{"candidates":2,"queries":3,"sha256":"8725087e8ec87ac86f8b98b22ff2ab4a0bd820cdaef53b318d13d3b9c2957354"},"section":["Complexity"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #fdbb1154","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[24703,24820],"span_sha256":"d87d2e53dac36e31f628888c0c94f2098c3d1278f6f133f7c82edde7b8795591"}},"location":{"quote":{"exact":"One can solve in linear time the emptiness problem for NFA, i.e.,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #32dd99bd","passage_key":"4f6492a6e5810272df7c272d03c814476b02ca84ed5b3ad247eceab84f9895ee","prominence":"central","receipt":{"candidates":2,"queries":3,"sha256":"00e356120198fd3ee0d16ef16afde0d91335cad4379f38746c9751a1b28f5850"},"section":["Complexity"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #32dd99bd","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[24945,25070],"span_sha256":"628458c119588534577afa8a45eb423bc9a8e641d30f58dc49f0f524e6e8d2b8"}},"location":{"quote":{"exact":"It is PSPACE-complete to test, given an NFA, whether it is universal,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #94177626","passage_key":"31269f36537ce71dffcdfb447b549978485817ec45885c9244c3ac18010a4b9f","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"cd052a28a68d85e2014382ad952947faa58425cdd38c648bf11d8e7937724e65"},"section":["Complexity"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #94177626","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[25071,25215],"span_sha256":"c615cc648d7ddcc7c900d1399bb95cb327b39526132f8396521112dc8d4cc67c"}},"location":{"quote":{"exact":"As a consequence, the same is true of the inclusion problem, i.e.,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #ff419391","passage_key":"5de38b8906da9796fb258188477d859ddf2e4dcf8cfe74f198360c9fec6e7dcb","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"ac64e7dfe44bcba56d2326a676c382de4157c45dcf7fd56b7735dbc33991bd17"},"section":["Complexity"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #ff419391","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[25216,25353],"span_sha256":"cfde16f96f2560a883b3dc25ad38fd057536e60e889cad28fd58fd847f4e71c9"}},"location":{"quote":{"exact":"Given as input an NFA A and an integer n, the counting"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #8eebf256","passage_key":"e7167191db4397853b7918fe1cf930f20b5e71faa0d1cfced94dda5ca0bbd2cc","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"6e5742eb9cb6a0b36998d411490eaaf26fff5b6145c63ed98db937774f41e329"},"section":["Complexity"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #8eebf256","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[25355,25369],"span_sha256":"45b4096e07bdf63e098a810f6d69108729eb5badb1633dee0e3b7180c924f40d"}},"location":{"quote":{"exact":"it is #P-hard."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #84a32fa1","passage_key":"221a61a5eddc1a3a1a1cef19d23e9d0b39e8376e13bc630fa863afa484b02a66","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"3674e658f36257c2734c38b77dd91a1dfd05955133a727f12ad77eb44131d691"},"section":["Complexity"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #84a32fa1","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[25370,25467],"span_sha256":"5261b3e71fe6dcb558d5bdfb8e3a0ee249b7d7030ea4b2de80573416653e0118"}},"location":{"quote":{"exact":"In fact, this problem is complete (under parsimonious reductions) for the complexity"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #b7656351","location_key":"6f4d2d18b3a5d5e146d0514dc984c2aa137e6054c4500b232c7894275302b334","pair_key":"d1cad8ed1028b9ce564024b9d8a0524d7430f7b9e680dc4b10d2ac165090c222","passage_key":"5b744065b94affd23afe6330aeb3e0903e8cd342ac90621d20ef15995ffde5e5","prominence":"supporting","rank":1,"section":["Application of NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #b7656351","kind":"theorem","note":"This gives the direction from a nondeterministic machine to a deterministic one; the reverse direction of the stated equivalence is not asserted here.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":315,"library":"mathlib","line":312,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"NFA.toDFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[25491,25613],"span_sha256":"ca61af476605f70c17ee1588778c266eb609aa7f09efc03cc5be2a84cc0f85af"}},"location":{"quote":{"exact":"NFAs and DFAs are equivalent in that if a language is recognized"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"high","item":"In-text #b7656351","location_key":"db2807c42f6532b941109e131e4ae159ebc437ca94d238c8396a51c30fad3312","pair_key":"880804f9260c657aceaed6772a924a3d851cf6a9d6f70bfc21180cdceb69abfd","passage_key":"5b744065b94affd23afe6330aeb3e0903e8cd342ac90621d20ef15995ffde5e5","prominence":"supporting","rank":2,"section":["Application of NFA"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-653406-1366106761::In-text #b7656351","kind":"theorem","note":"This gives only the converse direction, from a deterministic machine to a nondeterministic one, and not the direction handled by the subset construction.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":354,"library":"mathlib","line":348,"path":"Mathlib/Computability/NFA.lean","proof_status":"proved"}},"location":{"declaration":"DFA.toNFA_correct","module":"Mathlib.Computability.NFA"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","container-title":"Wikipedia","id":"enwiki-653406-1366106761","title":"Nondeterministic finite automaton","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"2b68332db9f10f500f6c685a859824af38814ed0beee9ec0d7d9c6ea52068f1c","layer_sha256":"ee086a74baf50c5d9880bf03d62840db383450d8b6485fe229aaa4b0fa68b501","licence":"CC-BY-SA-4.0","pageid":653406,"renderer":"web-html/3","span":[25491,25613],"span_sha256":"ca61af476605f70c17ee1588778c266eb609aa7f09efc03cc5be2a84cc0f85af"}},"location":{"quote":{"exact":"NFAs and DFAs are equivalent in that if a language is recognized"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=653406&oldid=1366106761","version":"1366106761"}]}
