日本の
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完全な記事
カテゴリ
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
あなたが書く
ユーザー
ログイン
登録
パスワードの復元
タグ
言語タグ
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
タグregular-languages - これはページ1です - GeneraCodice
Is it possible to build any regular expression in a computer language with just 3 basic operators?
https://www.generacodice.com/jp/articolo/2479885/is-it-possible-to-build-any-regular-expression-in-a-computer-language-with-just-3-basic-operators
regular-languages
-
regular-expressions
cs.stackexchange
知識の正規言語から構築された言語の規則性
https://www.generacodice.com/jp/articolo/2477946/知識の正規言語から構築された言語の規則性
finite-automata
-
computation-models
-
regular-languages
-
closure-properties
cs.stackexchange
Construct a DFA recognizing a language $L$ that has exactly $I(L)$ states
https://www.generacodice.com/jp/articolo/2477449/construct-a-dfa-recognizing-a-language-l-that-has-exactly-i-l-states
finite-automata
-
automata
-
formal-languages
-
regular-languages
cs.stackexchange
Check if a NFA accepts a string of non-prime length
https://www.generacodice.com/jp/articolo/2477198/check-if-a-nfa-accepts-a-string-of-non-prime-length
finite-automata
-
automata
-
algorithms
-
regular-languages
cs.stackexchange
How to prove $\{a^nb^na^n \mid n\geq1\}$ is not regular using pumping Lemma
https://www.generacodice.com/jp/articolo/2476797/how-to-prove-a-nb-na-n-mid-n-geq1-is-not-regular-using-pumping-lemma
automata
-
regular-languages
cs.stackexchange
なぜ$((aa)^ * bb(aa)^ * bb(aa)^ *)^ * ^ * $ $ x $
https://www.generacodice.com/jp/articolo/2476789/なぜ-aa-bb-aa-bb-aa-x
regular-languages
cs.stackexchange
Proof that L^2 is regular => L is regular
https://www.generacodice.com/jp/articolo/2476543/proof-that-l-2-is-regular-l-is-regular
automata
-
regular-languages
cs.stackexchange
$ L= $ {w $ \ in(a、b)^ * $}w、$ -5 \ le | u | u | u | u | _b \ le5 \} $は定期的に
https://www.generacodice.com/jp/articolo/2476181/-l-w-in-a-b-w-5-le-u-u-u-u-b-le5-は定期的に
finite-automata
-
automata
-
regular-languages
-
nondeterminism
cs.stackexchange
Does a regular expression exist for any number that contains no more than two 5s and no 6 twice in a row?
https://www.generacodice.com/jp/articolo/2473449/does-a-regular-expression-exist-for-any-number-that-contains-no-more-than-two-5s-and-no-6-twice-in-a-row
finite-automata
-
pumping-lemma
-
regular-languages
-
regular-expressions
cs.stackexchange
$ A $がコンテキストフリーである場合、$ A ^ * $は定期的です
https://www.generacodice.com/jp/articolo/2473412/-a-がコンテキストフリーである場合-a-は定期的です
formal-languages
-
regular-languages
-
context-free
cs.stackexchange
«
1
2
3
4
5
6
»
結果が見つかりました: 1328