Skip to content
MathsGenie logo
Open app

Course home

  1. A Level
  3. Computer Science AQA
  5. Flashcards

Regular languages

What is an alphabet in the context of regular languages?

A

A finite set of symbols that may appear in a string.

B

A finite sequence of symbols that may appear in a string.

C

An infinite set of symbols that may appear in a string.

D

A finite set of strings that may appear in a language.

Regular languages Flashcards

  1. A Level
  2. /Computer Science
  3. /Regular languages

Flashcards for AQA A Level Computer Science Regular languages, covering the key terms and definitions you need to recall. 25 cards, matched to the AQA A Level Computer Science (7517) specification.

Flashcards