出典:Wiktionary
regular language (複数形 regular languages)
出典:Wikipedia
出典:『Wikipedia』 (2011/05/25 09:33 UTC 版)
In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: