Spelling Error CorrectionExplores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
Basic PipeliningExplores basic pipelining in circuits, enhancing throughput by splitting jobs into sub-parts.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Lexicons, n-grams and Language ModelsExplores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
Formally Verified Chisel DesignsExplores formally verifying Chisel designs using SMT solvers and covers examples like delayed assertions and proofs by induction.
Birth and Death ChainsExplores transience and recurrence in Markov chains, emphasizing birth and death chains and random walks.
