<P> In theoretical computer science and formal language theory , a regular language ( also called a rational language ) is a formal language that can be expressed using a regular expression , in the strict sense of the latter notion used in theoretical computer science ( as opposed to many regular expressions engines provided by modern programming languages , which are augmented with features that allow recognition of languages that can not be expressed by a classic regular expression ) . </P>
<P> In theoretical computer science and formal language theory , a regular language ( also called a rational language ) is a formal language that can be expressed using a regular expression , in the strict sense of the latter notion used in theoretical computer science ( as opposed to many regular expressions engines provided by modern programming languages , which are augmented with features that allow recognition of languages that can not be expressed by a classic regular expression ) . </P>
what is regular language in theory of computation
what is regular language in theory of computation
a formal language that can be expressed using a regular expression , in the strict sense of the latter notion used in theoretical computer science
a formal language that can be expressed using a regular expression , in the strict sense of the latter notion used in theoretical computer science