Scott Theorem
April 5th, 2010There'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).
Posts from April 2010
Pumping lemma for regular languages
April 1st, 2010I did new article for Computer Science (in Polish) about Pumping lemma for regular languages - theorem and proof. Owning to this you can easily check that relevant language is not regular.
