Etiqueta chomsky-hierarchy - Esta es la página 4 - GeneraCodice

Chomsky Hierarchy and P vs NP

https://www.generacodice.com/es/articolo/1602004/chomsky-hierarchy-and-p-vs-np
  complexity-theory  -  chomsky-hierarchy  -  p-vs-np
cs.stackexchange cs.stackexchange

Is it possible for a Turing machine to be able to reduce a grammar and tell where it fits in chomsky hierarchy?

https://www.generacodice.com/es/articolo/1600475/is-it-possible-for-a-turing-machine-to-be-able-to-reduce-a-grammar-and-tell-where-it-fits-in-chomsky-hierarchy
  turing-machines  -  chomsky-hierarchy  -  formal-grammars
cs.stackexchange cs.stackexchange

Why does the Pumping-lemma for context-free languages use uvwxy, but the one for regular ones uvw?

https://www.generacodice.com/es/articolo/1599977/why-does-the-pumping-lemma-for-context-free-languages-use-uvwxy-but-the-one-for-regular-ones-uvw
  chomsky-hierarchy  -  pumping-lemma  -  regular-languages
cs.stackexchange cs.stackexchange

Type-0 grammar and terminal symbols

https://www.generacodice.com/es/articolo/1599654/type-0-grammar-and-terminal-symbols
  termination  -  finite-automata  -  automata  -  chomsky-hierarchy
cs.stackexchange cs.stackexchange

Decide whether this language is regular

https://www.generacodice.com/es/articolo/1597925/decide-whether-this-language-is-regular
  chomsky-hierarchy  -  regular-languages  -  context-free
cs.stackexchange cs.stackexchange

Is the empty string a terminal symbol?

https://www.generacodice.com/es/articolo/1593141/is-the-empty-string-a-terminal-symbol
  chomsky-hierarchy  -  normal-forms
cs.stackexchange cs.stackexchange

How can the intersection of CFLs and REGs be CFL if REG is a proper subset of CFL?

https://www.generacodice.com/es/articolo/1592512/how-can-the-intersection-of-cfls-and-regs-be-cfl-if-reg-is-a-proper-subset-of-cfl
  formal-languages  -  chomsky-hierarchy  -  regular-languages  -  context-free
cs.stackexchange cs.stackexchange

How can CFGs have epsilon rules if CSG may not have them?

https://www.generacodice.com/es/articolo/1582084/how-can-cfgs-have-epsilon-rules-if-csg-may-not-have-them
  chomsky-hierarchy  -  formal-grammars  -  context-free
cs.stackexchange cs.stackexchange

When did “regular” start referring to Type 3 languages/grammars?

https://www.generacodice.com/es/articolo/1581904/when-did-regular-start-referring-to-type-3-languages-grammars
  history  -  formal-languages  -  chomsky-hierarchy  -  formal-grammars
cs.stackexchange cs.stackexchange

How the closure properties of the formal languages dictate decidability of their problem

https://www.generacodice.com/es/articolo/1578309/how-the-closure-properties-of-the-formal-languages-dictate-decidability-of-their-problem
  automata  -  formal-languages  -  chomsky-hierarchy  -  undecidability  -  decision-problem
cs.stackexchange cs.stackexchange
Resultados encontrados: 54
scroll top