Tag formal-languages - Esta é a página 235 - GeneraCodice

Parsing arbitrary context-free grammars, mostly short snippets

https://www.generacodice.com/pt/articolo/1091456/parsing-arbitrary-context-free-grammars-mostly-short-snippets

formal-languages - parsers - compilers

cs.stackexchange

How to prove that a language is not context-free?

https://www.generacodice.com/pt/articolo/1091521/how-to-prove-that-a-language-is-not-context-free

formal-languages - reference-question - context-free - proof-techniques

cs.stackexchange

Decidable non-context-sensitive languages

https://www.generacodice.com/pt/articolo/1091540/decidable-non-context-sensitive-languages

complexity-theory - formal-languages - formal-grammars

cs.stackexchange

Show that { xy ∣ |x| = |y|, x ≠ y } is context-free

https://www.generacodice.com/pt/articolo/1091598/show-that-xy-x-y-x-y-is-context-free

formal-languages - context-free

cs.stackexchange

Languages accepted by modified versions of finite automata

https://www.generacodice.com/pt/articolo/1091737/languages-accepted-by-modified-versions-of-finite-automata

finite-automata - automata - formal-languages

cs.stackexchange

Is this language defined using twin primes regular?

https://www.generacodice.com/pt/articolo/1091743/is-this-language-defined-using-twin-primes-regular

finite-automata - automata - formal-languages - regular-languages

cs.stackexchange

Proving closure under complementation of languages accepted by min-heap automata

https://www.generacodice.com/pt/articolo/1091777/proving-closure-under-complementation-of-languages-accepted-by-min-heap-automata

automata - formal-languages - closure-properties

cs.stackexchange

Computational power of deterministic versus nondeterministic min-heap automata

https://www.generacodice.com/pt/articolo/1091783/computational-power-of-deterministic-versus-nondeterministic-min-heap-automata

automata - formal-languages - nondeterminism

cs.stackexchange

A DFA for recognizing comments

https://www.generacodice.com/pt/articolo/1091788/a-dfa-for-recognizing-comments

finite-automata - automata - formal-languages - compilers

cs.stackexchange

Can every linear grammar be converted to Greibach form?

https://www.generacodice.com/pt/articolo/1092321/can-every-linear-grammar-be-converted-to-greibach-form

formal-languages - formal-grammars

cs.stackexchange

Resultados encontrados: 2380