- an infinite set of the finite sequence defined over a language
- analysis of the behaviour of string defined over the language
- set of language accepted by finite automata
- it is a pattern which repeated itself over a definite sequence
PROPERTIES
- UNION :: L1UL2 is a regular language if L1 and L2 are regular
- CONCATENATION :: L1.L2 is a regular language if L1 and L2 are regular
- CLOSURE:: L* is a regular language.
No comments:
Post a Comment