Content deleted Content added
→Kleene's theorem: Reply |
→Kleene's theorem: Reply |
||
| (One intermediate revision by one other user not shown) | |||
Line 107:
:Provided that [[Regular_language#Equivalent_formalisms]] is right, Kleene's theorem state the equivalence of regular expressions and nondeterministic finite automata (with variations depending on the textbook author). Kleene's algorithm is used for one direction of the equivalence proof, and [[Thompson's construction]] for the other one, cf. notess 1 and 2 in the enumeration of equivalent chracterizations of regular languages. Since [[Regular_language#Equivalent_formalisms]] presents both directions, I consider this page a more adequate target of the redirect [[Kleene's theorem]]. - [[User:Jochen Burghardt|Jochen Burghardt]] ([[User talk:Jochen Burghardt|talk]]) 19:27, 9 December 2024 (UTC)
::Thanks for the clarification. Just in case I'm misunderstanding - 'this page' in your last sentence refers to [[Regular language]], right? [[User:Tule-hog|Tule-hog]] ([[User talk:Tule-hog|talk]]) 19:57, 9 December 2024 (UTC)
:::Yes, indeed. When I wrote my comment, I erroneously believed to be on [[Talk:Regular language]]. - Sorry for the confusion. - [[User:Jochen Burghardt|Jochen Burghardt]] ([[User talk:Jochen Burghardt|talk]]) 21:15, 10 December 2024 (UTC)
| |||