FSM Design and SynthesisCovers the design and synthesis of Finite State Machines, including completeness, consistency, ghost states, and transition tables.
Keylock in VHDL and on FPGACovers the design of a KeyLock system in VHDL, focusing on the FSM implementation for key validation and LED indication.
Spelling Error CorrectionExplores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
Universal Source CodingCovers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
