Welcome guest
You're not logged in.
291 users online, thereof 0 logged in

Definition: Language

Let $(\Sigma^*,\cdot)$ be the set of all strings over an alphabet $\Sigma$ with the concatenation operation “$\cdot$”. Any non-empty subset \(L\subseteq (\Sigma^*,\cdot)\) is called a language over the alphabet \(\Sigma \).

| | | | | created: 2018-01-05 23:46:27 | modified: 2020-05-04 18:16:31 | by: bookofproofs

1.Example: Examples of Languages

2.Definition: Concatenation of Languages

3.Definition: Iteration of Languages, Kleene Star, Kleene Plus

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 4.0 by:

This work is a derivative of:

Bibliography (further reading)