Tag regular-language - Dies ist Seite 22 - GeneraCodice

Ist diese Sprache regulär oder nicht?

https://www.generacodice.com/de/articolo/2204640/ist-diese-sprache-regulaer-oder-nicht
  turing-machines  -  regular-language  -  nfa  -  decidable  -  context-free-language
StackOverflow StackOverflow

Bitfolgen mit count (1s) anzeigen = count (0s) ist nicht regulär

https://www.generacodice.com/de/articolo/2020858/bitfolgen-mit-count-1s-anzeigen-count-0s-ist-nicht-regulaer
  algorithm  -  regex  -  proof  -  automata  -  regular-language
StackOverflow StackOverflow

Regular expressions

https://www.generacodice.com/de/articolo/1723546/regular-expressions
  bnf  -  context-free-grammar  -  formal-languages  -  regular-language
StackOverflow StackOverflow

Is there an efficient algorithm to decide whether the language accepted by one NFA is a superset of the language accepted by another?

https://www.generacodice.com/de/articolo/1693579/is-there-an-efficient-algorithm-to-decide-whether-the-language-accepted-by-one-nfa-is-a-superset-of-the-language-accepted-by-another
  algorithm  -  computer-science  -  finite-automata  -  regular-language  -  nfa
StackOverflow StackOverflow

How should one proceed to prove (or find) if two regular expressions are same or equivalent?

https://www.generacodice.com/de/articolo/1661552/how-should-one-proceed-to-prove-or-find-if-two-regular-expressions-are-same-or-equivalent
  regex  -  equivalence  -  finite-automata  -  regular-language
StackOverflow StackOverflow

Describing RE's in English Language

https://www.generacodice.com/de/articolo/1655682/describing-re-s-in-english-language
  regex  -  regular-language
StackOverflow StackOverflow

What regular language intersects with 1*0* gives 1n0n

https://www.generacodice.com/de/articolo/1488057/what-regular-language-intersects-with-1-0-gives-1n0n
  regex  -  automata  -  regular-language  -  automata-theory
StackOverflow StackOverflow

Is Regular language always infinite

https://www.generacodice.com/de/articolo/1391442/is-regular-language-always-infinite
  dfa  -  regular-language
StackOverflow StackOverflow

chomsky hierarchy in plain english

https://www.generacodice.com/de/articolo/1372674/chomsky-hierarchy-in-plain-english
  grammar  -  context-free-grammar  -  regular-language  -  context-sensitive-grammar
StackOverflow StackOverflow

Den regelmäßigen Ausdruck dieses endlichen Automatons verstehen (und bilden)

https://www.generacodice.com/de/articolo/1297298/den-regelmaessigen-ausdruck-dieses-endlichen-automatons-verstehen-und-bilden
  regex  -  finite-automata  -  automata  -  regular-language
StackOverflow StackOverflow
Gefundene Ergebnisse: 256
scroll top