Branches History Index

◀ ▲ ▶Branches / Theoretical-computer-science / Formal-languages / Theorem: Deterministic Finite Automata Describe Regular Languages

Theorem: Deterministic Finite Automata Describe Regular Languages

The languages $\mathcal L(\operatorname{DFA})$ accepted by a deterministic finite automata. DFA correspond exactly to the regular languages.

Table of Contents

Proofs: 1

Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs

References

Bibliography

  1. Erk, Katrin; Priese, Lutz: "Theoretische Informatik", Springer Verlag, 2000, 2nd Edition
  2. Hoffmann, Dirk: "Theoretische Informatik, 3. Auflage", Hanser, 2015