Finite-state machine

Finite-state machine

A finite-state machine is a mathematical model of computation that can be in one of a finite number of states at any given time. It changes from one state to another in response to inputs, and can be deterministic or non-deterministic. Examples of state machines in everyday life include vending machines, elevators, traffic lights, and combination locks. However, finite-state machines have less computational power than Turing machines due to their limited memory.

2 courses cover this concept

CSE 340 Interaction Programming

University of Washington

Spring 2022

This course focuses on the design and programming of interactive systems, exploring various programming paradigms, event handling, and accessibility. It requires prior knowledge of Java and familiarity with data structures. This course helps to develop user-friendly interfaces and study existing interfaces. Although the platform used is Android, it's not strictly an Android programming course.

No concepts data

+ 27 more concepts

CSE 447 and 517 Natural Language Processing

University of Washington

Winter 2022

This course provides a comprehensive overview of Natural Language Processing (NLP), including core components like text classification, machine translation, and syntax analysis. It offers two project types: implementation problem-solving for CSE 447, and reproducing experiments from recent NLP papers for CSE 517.

No concepts data

+ 16 more concepts