Alessandro Clerici

❯

❯

Formal Language Theory

❯

Deterministic Finite Automata

Deterministic Finite Automata

Jul 18, 20241 min read

The original definition of automaton, characterizing Regular Languages.

Its nondeterministic counterpart, NFA, also characterize regular languages.

Graph View

Backlinks

Block languages
Descriptional Complexity of 1-LA
Descriptional Complexity of Finite State Automata
Descriptional Complexity of OM-1-LA
Descriptional Complexity of unary 1-LA
Descriptional Complexity of unary Finite State Automata
Descriptional Complexity of unary OM-1-LA
Nondeterministic Finite Automata
Two-Way Deterministic Finite Automata
Two-Way Nondeterministic Finite Automata

Created with Quartz v4.5.0 © 2025

GitHub
LinkedIn
Telegram