Open xxleyi opened 3 years ago
Formal Languages
L(regular expression with syntax) = set of strings with meaning, where function L is many to 1, never 1 to many.
Def: let ∑ be set of characters (an alphabet). A language over ∑ is set of strings of characters drawn from ∑
Meaning function L maps syntax to semantics.
Formal Languages
L(regular expression with syntax) = set of strings with meaning, where function L is many to 1, never 1 to many.
Def: let ∑ be set of characters (an alphabet). A language over ∑ is set of strings of characters drawn from ∑
Meaning function L maps syntax to semantics.