Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Quantum finite automaton

Related lectures (31)

Finite Automata: Basics

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Regular Expressions (Recap)

Covers the fundamentals of regular expressions and includes exercises on defining languages.

From Regular Expressions to Automata

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

Convergence Rate Theorem: Part 2

Covers the proof of the convergence rate theorem, emphasizing detailed balance equations and ergodic Markov chains.

Idea of Symbolic Computation of Reachable States

Explores symbolic computation of reachable states in transition systems using fixed points and algorithms.

Universal Source Coding

Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.

Finite Automata: Regular Expressions and Deterministic Finite Automaton

Covers the conversion from finite automata to regular expressions and exercises on constructing deterministic finite automata.

Software Disasters and Successes: Verification Impact and Transition Systems

Explores software verification impact, disasters, successes, and transition systems.

Automata Theory: Basics and Theorems

Introduces the basics of automata theory and explores the theorems of regular languages.

Finite Automata: Recap

Covers the fundamentals of finite automata and formal languages.

Finite Automata: DFA to Regular Expression

Explains the transformation from a DFA to a Regular Expression and discusses important concepts in automata theory.

Birth and Death Chains

Explores transience and recurrence in Markov chains, emphasizing birth and death chains and random walks.

Disasters, Successes, and Inductive Invariants

Explores software disasters, successful verifications, transition systems, and invariants in systems.

Finite Automata: Recap and Determinization

Covers a recap on NFAs and introduces the determinization process.

Finite State Machines: Basics and Design Log in to Mediaspace to watch this video

Introduces finite state machines, covering basics, design, and practical applications like decoders and encoders.

Logic Systems: Sequential and Combinatorial Circuits Log in to Mediaspace to watch this video

Covers fundamental concepts of logic systems, including sequential and combinatorial circuits, state diagrams, and finite state machines.

Logic Systems: Finite State Machines Log in to Mediaspace to watch this video

Explores Boolean algebra, optimization, sequential systems, and finite state machines design.

Finite State Machines: Medvedev vs. Moore vs. Mealy Log in to Mediaspace to watch this video

Compares Medvedev, Moore, and Mealy FSM models and their structures.

Spelling Error Correction Log in to Mediaspace to watch this video

Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.

Lexicons, n-grams and Language Models Log in to Mediaspace to watch this video

Explores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.