ALPHABET:

Alphabet is defined as the finite set of symbols or characters and is denoted by

(sigma).
STRING:
String is defined as the sequence of characters from and is denoted by S or
W.
LANGUAGE:
Language is defined as the collection of strings or words and is denoted by L.
The languages described in finite automata are:

Regular language
Context free language
Context sensitive language
Recursive language
Recursive enumerable language

COMPUTABILITY OR DECIDABILITY:
A function f is said to be computable if a device exists to compute that function
with time and space. There exists an algorithm and a turing machine to solve a
function f. All computable functions are decidable.
Ex:1. F(x)=x+3
2. 1s complement of a given binary number.
3. Is input string w binary?
w=10101
YES, w is a binary string.
w=12345
NO, w is not a binary string.
NON-COMPUTABILITY OR UNDECIDABILITY:
No device exists to solve function f with time and space. No algorithm and
turing machine exists to solve the function f. All non-computable functions are
undecidable.
Ex:1. State entry problem.
2. Halting problems.
CHOMSKY HIERARCHY:

REGULAR LANGUAGE:

A regular language(RL) is defined as the language recognized by a finite

automata i.e., deterministic finite automata(DFA) and non-deterministic
finite automata(NFA).
It is a formal language that can be expressed using a regular
expression(RE).
Grammar generated for the regular language is regular grammar(RG) and
are defined to be Type-3 grammar.
The set of regular languages over an alphabet(),any language belonging
to this set is a regular language. Regular languages are very useful in
input parsing and programming language design.
No finite automata exists for given language then that language is not a
regular language (eg: pumping lemma).
Ex:When ={a,b} and the language L=(a+b) then,the regular language
generated is even number of as and bs.
CLOSURE PROPERTY:

A closure property is defined as statement that,a certain operations on

languages when applied to the languages in class produces result in that
class.
CLOSURE PROPERTIES OF REGULAR LANGUAGE:
The regular languages are closed under the various operations, i.e., if the
languages L1 and L2 are regular, then the following languages are regular
as well:

Union (L1L2)
Intersection (L1L2)
Set difference (L1-L2)

Concatenation (L1.L2 (or) L2.L1)

Kleene star (L1*)

Reversal
Homomorphism
Inverse Homomorphism

DECIDING WHETHER LANGUAGE IS REGULAR OR NOT:

The approaches to decide whether the language is regular or not is:

is a finite alphabet.
* denotes the free monoid over consisting of all strings over .
f:*
M is a monoid homomorphism where M is a finite monoid.
S is a subset of M.

DECIDABLE PROPERTIES OF REGULAR LANGUAGE:

Decidable properties of DFA,NFA,-NFA,RE is:

Language emptiness,universality,inclusion.

TO CHECK EMPTINESS:Basic case:- For atomic REs, we have

Empty() = true
Empty() = false
Empty(a) = false
Recursion:- For compound REs, we have
Empty(R+S) = empty(R) empty(S)
Empty(RS) = empty(R) empty(S)
Empty(R*) = false
Empty((R)) = empty(R)
TO CHECK MEMBERSHIP:
Whether a string w belongs to * is in the language L(A) of some
automata A, can be tested by rumming the automaton on w.
OTHER DECIDABLE PROPERTIES:
Due to the closure properties of regular languages, the emptiness test can
be used to decide.

Universality is L(A) = *?
Kleene-closedness is L(A)* = L(A)?

Inclusion is L(A) subset L(A)?

Disjointness is L(A)L(B) = ?
Image is h(L(A)) = L(B) for some given homomorphism.
Infiniteness of a regular language is decidable by analysing the
RE,does it contain a Kleene star over a language different from
and epsilon.

DETERMINISTIC CONTEXT-FREE LANGUAGE:

The deterministic context-free languages are a proper subset of contextfree languages. These are the context-free languages that can be
accepted by a deterministic pushdown automata.
Deterministic context-free languages are always unambiguous. The
grammar generated for the deterministic context-free language is contextfree grammar.
The language power of a pushdown automata is reduced if we make it
deterministic.
The languages of this class have great practical importance as they can
be parsed much more efficiently than non-deterministic context-free
languages.
The DCFL is very important for computer language translation because
many computer languages belong to this class of languages.
Ex:L= {WW/W belongs to (a+b)*}
CLOSURE PROPERTIES:
The set of deterministic context-free languages are not closed under union
but are closed under complement.
CONTEXT-FREE LANGUAGES:
A language is a context-free language if all of its strings are generated by
a context-free grammar.
The set of all context-free languages is identical to the set of languages
accepted by PDA, which makes these languages enable to parsing.

Grammar generated for context-free language is context-free grammar.

Different context-free grammars can generate the same context-free
language. Most arithmetic expressions are generated by context-free
grammars.
Ex:- A context-free language of all non-empty even length strings, the
entire first halves of which are as and second halves of which are bs.
L is generated by the grammar SaSb/ab. This language is not regular. It
is accepted by the PDA.
CLOSURE PROPERTIES:
Context-free languages are closed under the following operations i.e. , if
L1 and L2 are context-free languages, the following languages are
context-free as well:

Union
Reversal
Concatenation
Kleene -star

DECIDABLE PROPERTIES:
Emptiness - L(A) =.
Finiteness L(A) should be finite with no loops.
Membership - with w belong toL(G).
UNDECIDABLE PROPERTIES:
Equivalence L(A) = L(b)
Intersection emptiness-L(A)L(B) =
ContainmentL(A) subset of L(B)
Universality- L(A) = *?
TESTING EMPTINESS:
Can detect variables that generates no terminal string.