生せい成せい子し完かん全ぜん集しゅう合ごう

noun

complete generator set

Technical term in computing, specifically in the context of formal language theory or automata theory. Refers to a set of generators that can produce all elements of a given set or language.

• この生せい成せい子し完かん全ぜん集しゅう合ごうは、与あたえられた言げん語ごのすべての文も字じ列れつを生せい成せいできる。

  This complete generator set can generate all strings of the given language.