正規言語の反復補題
1. Pumping lemma for regular languagesIn the theory of formal languages, the pumping lemma for regular languages describes an essential property of all regular languages. Informally, it says that all sufficiently long words in a regular language may be pumped — that is, have a middle section of the word repeated an arbitrary number of times — to produce a new word which also lies within the same language.
Read “Pumping lemma for regular languages” on English Wikipedia
Read “正規言語の反復補題” on Japanese Wikipedia
Read “Pumping lemma for regular languages” on DBpedia
Read “Pumping lemma for regular languages” on English Wikipedia
Read “正規言語の反復補題” on Japanese Wikipedia
Read “Pumping lemma for regular languages” on DBpedia
Discussions
Log in to talk about this word.