Tag closure-properties - This is page 4 - GeneraCodice

if $L_1$ and $L_2$ are languages over the same alphabet and $L_1 \cap L_2$ is context free, at least one of them must be context free

https://www.generacodice.com/en/articolo/1605749/if-l-1-and-l-2-are-languages-over-the-same-alphabet-and-l-1-cap-l-2-is-context-free-at-least-one-of-them-must-be-context-free
  regular-languages  -  context-free  -  closure-properties
cs.stackexchange cs.stackexchange

Finding if the given language is regular or not

https://www.generacodice.com/en/articolo/1602397/finding-if-the-given-language-is-regular-or-not
  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Finite state automaton for the reverse of the language, and multiple starting states

https://www.generacodice.com/en/articolo/1602268/finite-state-automaton-for-the-reverse-of-the-language-and-multiple-starting-states
  finite-automata  -  automata  -  closure-properties
cs.stackexchange cs.stackexchange

Show that RP is closed under concatenation

https://www.generacodice.com/en/articolo/1602170/show-that-rp-is-closed-under-concatenation
  complexity-theory  -  closure-properties  -  randomized-algorithms  -  complexity-classes
cs.stackexchange cs.stackexchange

Proving that if L is regular. Then L′ = {ww : w ∈ L} is regular

https://www.generacodice.com/en/articolo/1598590/proving-that-if-l-is-regular-then-l-ww-w-l-is-regular
  formal-languages  -  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Class P is closed under concatenation

https://www.generacodice.com/en/articolo/1598502/class-p-is-closed-under-concatenation
  complexity-theory  -  closure-properties  -  polynomial-time
cs.stackexchange cs.stackexchange

Proving that $\{0^i10^i : i \ge 1\}$ is non-regular, using only closure results

https://www.generacodice.com/en/articolo/1598125/proving-that-0-i10-i-i-ge-1-is-non-regular-using-only-closure-results
  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Show that the collection of Turing-recognizable languages is closed under homomorphism [duplicate]

https://www.generacodice.com/en/articolo/1596686/show-that-the-collection-of-turing-recognizable-languages-is-closed-under-homomorphism-duplicate
  turing-machines  -  formal-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Can the regular image of a context-free language be undecidable?

https://www.generacodice.com/en/articolo/1596631/can-the-regular-image-of-a-context-free-language-be-undecidable
  formal-languages  -  regular-languages  -  context-free  -  closure-properties
cs.stackexchange cs.stackexchange

XOR of two NP-Complete languages

https://www.generacodice.com/en/articolo/1596063/xor-of-two-np-complete-languages
  complexity-theory  -  np-complete  -  time-complexity  -  closure-properties
cs.stackexchange cs.stackexchange
Results found: 308
scroll top