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

Concept

Finite-state transducer

Related lectures (32)

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

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

Covers the renormalization of gauge theories and composite operators.

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

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

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

Covers determinantal point processes, sine-process, and their extrapolation in different spaces.

Explores internal states and hierarchical control in robotics, focusing on behaviors and neural circuits for hunger.

Explores the conversion of regular expressions to automata for efficient character classification.

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

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

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

Explores synchronous logic circuits, state-based modeling, optimization techniques, and finite-state machine state minimization.

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

Explores synchronous logic circuits, modeling techniques, state minimization, and finite-state machine optimization for area reduction.

Covers the Theoreus Chain Role for Lipschitz functions and its practical applications.

Explores finite state machines, subsumption architecture, obstacle avoidance, and robot kinematics in robotics.

Covers the design and synthesis of Finite State Machines, emphasizing completeness, consistency, and ghost states.

Covers the design and synthesis of Finite State Machines, including completeness, consistency, ghost states, and transition tables.

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