formal language

References

Summary

Definition

Given an alphabet A, with free monoid A*, a formal language L with alphabet A is a subset of A*.

Types

Each kind of language corresponds to a certain kind of automaton

Regular

Corresponds to finite automata

Context-Free