Tag regular-languages - Esta é a página 2 - GeneraCodice

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

https://www.generacodice.com/pt/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

Regularidade de uma linguagem construída de uma linguagem regular

https://www.generacodice.com/pt/articolo/2477946/regularidade-de-uma-linguagem-construida-de-uma-linguagem-regular
  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/pt/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/pt/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/pt/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

Por que é $ ((AA) ^ * bb (AA) ^ * bb (AA) ^ *) ^ * $ de altura da estrela 1

https://www.generacodice.com/pt/articolo/2476789/por-que-e-aa-bb-aa-bb-aa-de-altura-da-estrela-1
  regular-languages
cs.stackexchange cs.stackexchange

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

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

Show $ l= $ {w $ \ em (a, b) ^ * $ |Para cada substrição u de W, $ -5 \ le | u | _a- | u | _b \ le5} $ é regular

https://www.generacodice.com/pt/articolo/2476181/show-l-w-em-a-b-para-cada-substricao-u-de-w-5-le-u-a-u-b-le5-e-regular
  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/pt/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

Se $ a $ é livre de contexto, então $ a ^ * $ é regular

https://www.generacodice.com/pt/articolo/2473412/se-a-e-livre-de-contexto-entao-a-e-regular
  formal-languages  -  regular-languages  -  context-free
cs.stackexchange cs.stackexchange
Resultados encontrados: 1328
scroll top