标签regular-languages - 这是页2 - GeneraCodice

Is it possible to build any regular expression in a computer language with just 3 basic operators?

https://www.generacodice.com/cn/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 cs.stackexchange

从知识常规语言构建的语言的规律性

https://www.generacodice.com/cn/articolo/2477946/从知识常规语言构建的语言的规律性
  finite-automata  -  computation-models  -  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Construct a DFA recognizing a language $L$ that has exactly $I(L)$ states

https://www.generacodice.com/cn/articolo/2477449/construct-a-dfa-recognizing-a-language-l-that-has-exactly-i-l-states
  finite-automata  -  automata  -  formal-languages  -  regular-languages
cs.stackexchange cs.stackexchange

Check if a NFA accepts a string of non-prime length

https://www.generacodice.com/cn/articolo/2477198/check-if-a-nfa-accepts-a-string-of-non-prime-length
  finite-automata  -  automata  -  algorithms  -  regular-languages
cs.stackexchange cs.stackexchange

How to prove $\{a^nb^na^n \mid n\geq1\}$ is not regular using pumping Lemma

https://www.generacodice.com/cn/articolo/2476797/how-to-prove-a-nb-na-n-mid-n-geq1-is-not-regular-using-pumping-lemma
  automata  -  regular-languages
cs.stackexchange cs.stackexchange

为什么是$（（aa）^ * bb（aa）^ * bb（aa）^ *）^ * $的星高度1

https://www.generacodice.com/cn/articolo/2476789/为什么是-aa-bb-aa-bb-aa-的星高度1
  regular-languages
cs.stackexchange cs.stackexchange

Proof that L^2 is regular => L is regular

https://www.generacodice.com/cn/articolo/2476543/proof-that-l-2-is-regular-l-is-regular
  automata  -  regular-languages
cs.stackexchange cs.stackexchange

显示$ l= $ {w $ \ in（a，b）^ * $ |对于W，$ -5 \ Le | U | _a-| U | _b \ Le5 \} $常规

https://www.generacodice.com/cn/articolo/2476181/显示-l-w-in-a-b-对于w-5-le-u-a-u-b-le5-常规
  finite-automata  -  automata  -  regular-languages  -  nondeterminism
cs.stackexchange 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/cn/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 cs.stackexchange

如果$ a $ was上下文中，则$ a ^ * $是常规的

https://www.generacodice.com/cn/articolo/2473412/如果-a-was上下文中-则-a-是常规的
  formal-languages  -  regular-languages  -  context-free
cs.stackexchange cs.stackexchange
发现结果: 1328
scroll top