Lukas' Notes

Finite Automaton

Dec 13, 20251 min read

computation

Definition

Finite Automaton

A Turing machine that does not need a separate work band. The transition function is simplified:

δ:Q×Σ→Q×{L,R,S}

Graph View

Backlinks

  • Regular Language

Created with Quartz v4.4.0 © 2025

  • GitHub