正せい規き言げん語ご

noun

regular language

Technical term in formal language theory and computer science. A regular language is a formal language that can be expressed by a regular expression or recognized by a finite automaton.

• 正せい規き言げん語ごは有ゆう限げんオートマトンで受じゅ理りできる言げん語ごのクラスです。

  Regular languages are the class of languages that can be accepted by finite automata.

• この正せい規き表ひょう現げんが表あらわす正せい規き言げん語ごを説せつ明めいしてください。

  Please explain the regular language represented by this regular expression.