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

Determining capabilities of a min-heap (or other exotic) state machines

https://www.generacodice.com/pt/articolo/1091194/determining-capabilities-of-a-min-heap-or-other-exotic-state-machines

automata - formal-languages

cs.stackexchange

What are the conditions for a NFA for its equivalent DFA to be maximal in size?

https://www.generacodice.com/pt/articolo/1091231/what-are-the-conditions-for-a-nfa-for-its-equivalent-dfa-to-be-maximal-in-size

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

cs.stackexchange

A sufficient and necessary condition about regularity of a language

https://www.generacodice.com/pt/articolo/1091294/a-sufficient-and-necessary-condition-about-regularity-of-a-language

formal-languages - regular-languages

cs.stackexchange

What are the possible sets of word lengths in a regular language?

https://www.generacodice.com/pt/articolo/1091307/what-are-the-possible-sets-of-word-lengths-in-a-regular-language

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

cs.stackexchange

Is there a “natural” undecidable language?

https://www.generacodice.com/pt/articolo/1091335/is-there-a-natural-undecidable-language

computability - automata - formal-languages - undecidability

cs.stackexchange

Is an inﬁnite union of context-free languages always context-free?

https://www.generacodice.com/pt/articolo/1091390/is-an-inﬁnite-union-of-context-free-languages-always-context-free

formal-languages - context-free - closure-properties

cs.stackexchange

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

Resultados encontrados: 2380