Quantcast
Channel: Understanding failures of recursive calls on simple proof about FSA and regular languages in Agda - Stack Overflow
Browsing latest articles
Browse All 2 View Live

Answer by MrO for Understanding failures of recursive calls on simple proof...

Your post is very large and contains numerous elements, which all can be commented in different ways. I will address them one by one, and explain the choices I made to make these elements more easily...

View Article



Understanding failures of recursive calls on simple proof about FSA and...

I'm trying to prove that a simple FSA in Agda only accepts string which end in zero- this is the first example in Sipser's book. I didn't implement evalFSA as a predicate, but rather as function, and...

View Article
Browsing latest articles
Browse All 2 View Live


Latest Images