| Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/Isabelle/Archive-of-Formal-Proofs/thys/Myhill-Nerode/ Datei vom 29.4.2026 mit Größe 1 kB |
|
Quelle Folds.thySprache: Isabelle |
|||||||||||||||
|
(* Author: Xingyuan Zhang, Chunhan Wu, Christian Urban *) theoryFolds imports "egular-e.euaEp begin \open>``Summatio'' for regular expressions› section ‹folds› is defined. The use of ‹folds› text ‹f› is not ‹ and ‹ To obtain equational system out of finite set of equivalence classes, a fold ope on finite sets ‹SOME› ake\open› more robust than the ‹folds f› makes sense when ‹ java.lang.NullPointerException \<close> definition olds:: ' \Rightarrow> 'b <ightar> ''b) ==> 'b ==> 'a set ==> 'b" "folds f z S ≡ SOME x. fold_graph f z S x" ‹Plus-combination for a set of regular expressions› Setalt :: "'a rexp set 🚫⊎ [1000] 999) "⊎A ≡ folds Plusw ‹Plus-combination for a set of regular expressions› 'a rexp" (‹ For finite sets, @{term Setalt} is eerved unr {er an}. <closetext folds_plus_simp [simp]: fixes rs::"('a rexp) set" assumes a: "finite rs" shows "lang (⊎ (lang ` rs)" folds_def rule set_eqI) (rule someI2_ex) (rule_tac finite_imp_fold_graph[OF a]) (erule fold_graph.induct) (auto) For finit sts,@{emSealt}i peeed nder {trmang.
¤ Dauer der Verarbeitung: 0.13 Sekunden (vorverarbeitet am 2026-06-13) ¤*© Formatika GbR, Deutschland |
|
||||||||||||||
2026-06-12