Decision Properties of Regular Languages || FLAT || TOC || GiriRaj Talks

Decision Properties of Regular Languages || FLAT || TOC || GiriRaj Talks
A regular language satisfies the following equivalent properties: it is the language of a regular expression (by the above definition) it is the language accepted by a nondeterministic finite automaton (NFA) it is the language accepted by a deterministic finite automaton (DFA)
The decision algorithm for regular sets requires the following points to be remembered: a. An algorithm must always terminated to be called an algorithm.
A regular language is one which has an FA or an RE. Regular languages are closed under union, concatenation, star, and complementation.
Regular Expressions are used to denote regular languages. An expression is regular if: ... ɛ is a regular expression for regular language {ɛ}. If a ∈ Σ (Σ represents the input alphabet), a is regular expression with language {a}. If a and b are regular expression, a + b is also a regular expression with language {a,b}.

[@jyothithota1469]

Thank you Sir