Tag closure-properties - This is page 1 - GeneraCodice

Regularity of a language constructed from a know regular language

https://www.generacodice.com/en/articolo/2477946/regularity-of-a-language-constructed-from-a-know-regular-language
  finite-automata  -  computation-models  -  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

PDA kleene star construction

https://www.generacodice.com/en/articolo/2473967/pda-kleene-star-construction
  pushdown-automata  -  context-free  -  closure-properties
cs.stackexchange cs.stackexchange

closure of Context free grammer to homomorphism using PDA

https://www.generacodice.com/en/articolo/2471337/closure-of-context-free-grammer-to-homomorphism-using-pda
  context-free  -  closure-properties
cs.stackexchange cs.stackexchange

How to define an automata for zig zag concatenation? [duplicate]

https://www.generacodice.com/en/articolo/2467569/how-to-define-an-automata-for-zig-zag-concatenation-duplicate
  finite-automata  -  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Zigzag concatenation of two languages

https://www.generacodice.com/en/articolo/2467484/zigzag-concatenation-of-two-languages
  finite-automata  -  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Strings of infinite length?

https://www.generacodice.com/en/articolo/2467006/strings-of-infinite-length
  closure-properties  -  strings
cs.stackexchange cs.stackexchange

$\mathcal{G} = \{ v_2 v_4 \ldots v_{k} : v_1 v_2 v_3 v_4 \ldots v_{k-1} v_{k} \in \mathcal{L}, \text{ $k$ even} \} $ is context free language

https://www.generacodice.com/en/articolo/2465951/-mathcal-g-v-2-v-4-ldots-v-k-v-1-v-2-v-3-v-4-ldots-v-k-1-v-k-in-mathcal-l-text-k-even-is-context-free-language
  pushdown-automata  -  context-free  -  closure-properties
cs.stackexchange cs.stackexchange

Why L' is not regular?

https://www.generacodice.com/en/articolo/2451826/why-l-is-not-regular
  automata  -  regular-languages  -  closure-properties  -  regular-expressions
cs.stackexchange cs.stackexchange

Prove/disprove: If $𝐿_1$ is a finite language but not empty and $𝐿_2$ is NOT regular then $𝐿_1 \circ 𝐿_2$ is NOT regular

https://www.generacodice.com/en/articolo/2447072/prove-disprove-if-𝐿-1-is-a-finite-language-but-not-empty-and-𝐿-2-is-not-regular-then-𝐿-1-circ-𝐿-2-is-not-regular
  finite-automata  -  automata  -  regular-languages  -  context-free  -  closure-properties
cs.stackexchange cs.stackexchange

Quotient of languages, regular quotient and their closedness

https://www.generacodice.com/en/articolo/2441455/quotient-of-languages-regular-quotient-and-their-closedness
  formal-languages  -  closure-properties
cs.stackexchange cs.stackexchange
Results found: 308
scroll top