Computing - Regular Languages

Created: January 12, 2021

---

See also:

[[Computing - Sets]]^A

• [[Computing - Regular Expressions]]^A
• [[Computing - Turing Machines]]^A
• [[Computing - Backus-Naur Form]]^A
• [[Computing - Syntax Diagrams]]^A
• [[Computing - Parsing]]^A

What is a regular language?

---

A language that can be described by a regular expression or a finite state machine.

---

Related posts

• [[Computing - Sets]]^A

  (outgoing)
• [[Computing - Regular Expressions]]^A

  (outgoing)
• [[Computing - Turing Machines]]^A

  (outgoing)
• [[Computing - Backus-Naur Form]]^A

  (outgoing)
• [[Computing - Syntax Diagrams]]^A

  (outgoing)
• [[Computing - Parsing]]^A

  (outgoing)
• [[Computing - Syllabus]]^A

  (incoming)
• [[Notes - Models of Computation MT23, Regular languages]]^U

  (sim: 0.636)
• [[Computing - Finite State Machines]]^A

  (sim: 0.565)
• [[Course - Models of Computation MT23]]^U

  (sim: 0.526)
• [[Lecture - Models of Computation MT23, III]]^U

  (sim: 0.519)