|
The languages can be defined in different ways , such as Descriptive definition, Recursive definition, using Regular Expressions(RE) and using Finite Automaton(FA) etc.
Descriptive definition of language The language is defined, describing the conditions imposed on its words.
Example The language L of strings of odd length, defined over Σ={a}, can be written as L={a, aaa, aaaaa,…..}
Example The language L of strings that does not start with a, defined over Σ ={a,b,c}, can be written as L ={L, b, c, ba, bb, bc, ca, cb, cc, …}
Example The language L of strings of length 2, defined over Σ ={0,1,2}, can be written as L={00, 01, 02,10, 11,12,20,21,22}
Example The language L of strings ending in 0, defined over Σ ={0,1}, can be written as L={0,00,10,000,010,100,110,…}
| ||||
Previous | TOC | Next | ||