HoTTEST Summer School HoTT Notes 3

Notes for the third HoTT course of HoTTEST Summer School 2022

HoTTEST Summer School HoTT Notes 2

Notes for the second HoTT course of HoTTEST Summer School 2022

HoTTEST Summer School HoTT Notes 1

Notes for the first HoTT course of HoTTEST Summer School 2022

Automata Theory • Finite State Machines

This chapter introduces the most common finite state machines and the language class they can recognize - regular languages.

Hello zola!

I'm stepping down from hexo to zola, this passage will tell you why.

How to implement an easiest compiler

I started trying to learn compiling principles since junior high school but I give up again and again, now I'm in the university and I finally get some basic idea of it.

Regular Expressions <-> Regular Grammar

This is a chapter I spent quite a bit of time on while learning compiler principles. I'm writing this article to help other students learn and for my own reference.