Lectures related to Idea of Symbolic Computation of Reachable States

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

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

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

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

Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.

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

Explores stability properties and fixed points in discrete time solutions.

Explores scaling and renormalization in statistical mechanics, emphasizing critical points and invariant properties.

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

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

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

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

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

Covers the convergence of fixed point methods for nonlinear equations, including global and local convergence theorems and the order of convergence.

Covers finite state machines, their types, structures, and practical applications in digital systems.

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

Explains the steps in FSM design, including transition and code table creation.

Covers the Picard method for solving nonlinear equations using fixed point iteration.

Explores the numerical analysis of nonlinear equations, focusing on convergence criteria and methods like bisection and fixed-point iteration.

Provides an overview of finite state machines, covering their design, analysis, and practical applications in digital systems.