There's new theorem & its proof (in polish) in Computer Science section which applies to the theory of automata. It's about equivalence of DFA and NFA, known as Scott Theorem (for me).
There's new theorem & its proof (in polish) in Computer Science section which applies to the theory of automata. It's about equivalence of DFA and NFA, known as Scott Theorem (for me).