Zulip Chat Archive
Stream: triage
Topic: PR #14250: feat(computability): prove equivalence of NFAs...
Random Issue Bot (Oct 17 2022 at 14:39):
Today I chose PR 14250 for discussion!
feat(computability): prove equivalence of NFAs and regular expressions
Created by @Russell Emerine (@RussellEmerine) on 2022-05-19
Labels: awaiting-author
Is this PR still relevant? Any recent updates? Anyone making progress?
Random Issue Bot (Feb 08 2023 at 14:09):
Today I chose PR 14250 for discussion!
feat(computability): prove equivalence of NFAs and regular expressions
Created by @Russell Emerine (@RussellEmerine) on 2022-05-19
Labels: awaiting-author
Is this PR still relevant? Any recent updates? Anyone making progress?
Random Issue Bot (Aug 02 2023 at 14:07):
Today I chose PR 14250 for discussion!
feat(computability): prove equivalence of NFAs and regular expressions
Created by @Russell Emerine (@RussellEmerine) on 2022-05-19
Labels: awaiting-author, too-late
Is this PR still relevant? Any recent updates? Anyone making progress?
Last updated: Dec 20 2023 at 11:08 UTC