Computing - Regular Languages

Created: January 12, 2021 | Read markdown | About these notes | View in context | Study these flashcards | Expand all

---

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?

734b8e8a9bff415590bfa266e47ebbb8

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 - Finite State Machines^A

  (sim: 0.572)
• Computing - Syllabus^A

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

  (sim: 0.614)
• Lecture - Models of Computation MT23, II^U

  (sim: 0.534)
• Lecture - Models of Computation MT23, III^U

  (sim: 0.526)