From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
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.
Two-Fluid WavesExplores two-fluid waves in plasma physics, discussing dispersion relations and wave propagation characteristics.
Spelling Error CorrectionExplores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
FSM Design and SynthesisCovers the design and synthesis of Finite State Machines, emphasizing completeness, consistency, and ghost states.
FSM Design and SynthesisCovers the design and synthesis of Finite State Machines, including completeness, consistency, ghost states, and transition tables.
Universal Source CodingCovers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
