标签formal-languages - 这是页8 - GeneraCodice

adding variables/types to a typing environment

https://www.generacodice.com/cn/articolo/4568119/adding-variables-types-to-a-typing-environment
  functional-programming  -  inference  -  formal-languages  -  formal-semantics
StackOverflow StackOverflow

What kind of formal languages can modern regex engines parse?

https://www.generacodice.com/cn/articolo/4464967/what-kind-of-formal-languages-can-modern-regex-engines-parse
  regex  -  computer-science  -  formal-languages
StackOverflow StackOverflow

how can i see directly that a language is not regular

https://www.generacodice.com/cn/articolo/4387815/how-can-i-see-directly-that-a-language-is-not-regular
  formal-languages  -  regular-language
StackOverflow StackOverflow

How to prove that L={w|#a(w)=#b(w)=#c(w)} is not context free using closure

https://www.generacodice.com/cn/articolo/4370393/how-to-prove-that-l-w-a-w-b-w-c-w-is-not-context-free-using-closure
  context-free-grammar  -  formal-languages
StackOverflow StackOverflow

Formal Methods, Logic and VDM past exam paper questions

https://www.generacodice.com/cn/articolo/4280953/formal-methods-logic-and-vdm-past-exam-paper-questions
  methods  -  logic  -  formal-methods  -  formal-languages
StackOverflow StackOverflow

How come we write programs in context-free languages? Shouldn't programs be in recursively enumerable languages in order to be Turing complete? [closed]

https://www.generacodice.com/cn/articolo/4263521/how-come-we-write-programs-in-context-free-languages-shouldn-t-programs-be-in-recursively-enumerable-languages-in-order-to-be-turing-complete-closed
  computer-science  -  programming-languages  -  formal-languages  -  computation-theory
StackOverflow StackOverflow

How to convert NFA to Regular Expression

https://www.generacodice.com/cn/articolo/3816515/how-to-convert-nfa-to-regular-expression
  regex  -  formal-languages  -  nfa
StackOverflow StackOverflow

How to convert NFA to Regular Expression

https://www.generacodice.com/cn/articolo/3816281/how-to-convert-nfa-to-regular-expression
  regex  -  formal-languages  -  nfa
StackOverflow StackOverflow

find Reg. Expr. over {0,1,2} so last symbol of string is the sum of the symbols so far on the string mod 3.

https://www.generacodice.com/cn/articolo/3750197/find-reg-expr-over-0-1-2-so-last-symbol-of-string-is-the-sum-of-the-symbols-so-far-on-the-string-mod-3
  regex  -  formal-languages  -  regular-language
StackOverflow StackOverflow

find Reg. Expr. over {0,1,2} so last symbol of string is the sum of the symbols so far on the string mod 3.

https://www.generacodice.com/cn/articolo/3746410/find-reg-expr-over-0-1-2-so-last-symbol-of-string-is-the-sum-of-the-symbols-so-far-on-the-string-mod-3
  regex  -  formal-languages  -  regular-language
StackOverflow StackOverflow
发现结果: 2380
scroll top