Computing - Regular Languages

AQA Computer Science 2022

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

See also:

What is a regular language?

regular-language-definition

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

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.617)
Notes - Models of Computation MT23, Regular expressions^U

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

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

(sim: 0.517)