Italiano
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Articoli completi
Categorie
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
Scrivi
Utente
Login
Registrazione
Recupero della password
Tag
Tag di lingua
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag regular-languages - Questa è pagina 1 - GeneraCodice
Is it possible to build any regular expression in a computer language with just 3 basic operators?
https://www.generacodice.com/it/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
Regolarità di una lingua costruita da una lingua normale conosciuta
https://www.generacodice.com/it/articolo/2477946/regolarita-di-una-lingua-costruita-da-una-lingua-normale-conosciuta
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/it/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/it/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/it/articolo/2476797/how-to-prove-a-nb-na-n-mid-n-geq1-is-not-regular-using-pumping-lemma
automata
-
regular-languages
cs.stackexchange
Perché $((aa)^*bb(aa)^*bb(aa)^*)^*$ di altezza stella 1
https://www.generacodice.com/it/articolo/2476789/perche-aa-bb-aa-bb-aa-di-altezza-stella-1
regular-languages
cs.stackexchange
Proof that L^2 is regular => L is regular
https://www.generacodice.com/it/articolo/2476543/proof-that-l-2-is-regular-l-is-regular
automata
-
regular-languages
cs.stackexchange
Mostra $ L= $ {W $ \ in (a, b) ^ * $ |per tutte le sottostringa di W, $ -5 \ Le | u | _a- | u | _b \ le5 \} $ è regolare
https://www.generacodice.com/it/articolo/2476181/mostra-l-w-in-a-b-per-tutte-le-sottostringa-di-w-5-le-u-a-u-b-le5-e-regolare
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/it/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
Se $ A $ è senza contesto, allora $ a ^ * $ è regolare
https://www.generacodice.com/it/articolo/2473412/se-a-e-senza-contesto-allora-a-e-regolare
formal-languages
-
regular-languages
-
context-free
cs.stackexchange
«
1
2
3
4
5
6
»
Risultati trovati: 1328