Editing Regular expression (section)

==Induction==
{{Main|Induction of regular languages}}

Regular expressions can often be created ("induced" or "learned") based on a set of example strings. This is known as the [[induction of regular languages]] and is part of the general problem of [[grammar induction]] in [[computational learning theory]]. Formally, given examples of strings in a regular language, and perhaps also given examples of strings ''not'' in that regular language, it is possible to induce a grammar for the language, i.e., a regular expression that generates that language. Not all regular languages can be induced in this way (see [[language identification in the limit]]), but many can. For example, the set of examples {1, 10, 100}, and negative set (of counterexamples) {11, 1001, 101, 0} can be used to induce the regular expression 1⋅0* (1 followed by zero or more 0s).