Tag arcidable - This is page 1 - GeneraCodice

How to come up with a solution of finite or infinite language using context free grammar?

https://www.generacodice.com/en/articolo/13034527/how-to-come-up-with-a-solution-of-finite-or-infinite-language-using-context-free-grammar

  context-free-grammar  -  decidable

StackOverflow

Why is E(dfa) a decidable language?

https://www.generacodice.com/en/articolo/12558451/why-is-e-dfa-a-decidable-language

  language-agnostic  -  turing-machines  -  programming-languages  -  dfa  -  decidable

StackOverflow

natural numbers and the difference between recognizable and decidable?

https://www.generacodice.com/en/articolo/12134312/natural-numbers-and-the-difference-between-recognizable-and-decidable

  turing-machines  -  decidable

StackOverflow

EPR formulas with equality and inequality

https://www.generacodice.com/en/articolo/7775616/epr-formulas-with-equality-and-inequality

  logic  -  z3  -  decidable  -  smt

StackOverflow

Haskell/GHC UndecidableInstances - example for non-terminating type check?

https://www.generacodice.com/en/articolo/6248197/haskell-ghc-undecidableinstances-example-for-non-terminating-type-check

  haskell  -  ghc  -  typechecking  -  decidable

StackOverflow

L = {T | T is a turing machine that recognizes {00, 01}} Prove L is undecidable

https://www.generacodice.com/en/articolo/5485157/l-t-t-is-a-turing-machine-that-recognizes-00-01-prove-l-is-undecidable

  turing-machines  -  reduction  -  decidable

StackOverflow

Relationship between NP-hard and undecidable problems

https://www.generacodice.com/en/articolo/4230213/relationship-between-np-hard-and-undecidable-problems

  algorithm  -  np-hard  -  decidable

StackOverflow

haskell : making a superclass of Num

https://www.generacodice.com/en/articolo/4024209/haskell-making-a-superclass-of-num

  haskell  -  typeclass  -  superclass  -  decidable

StackOverflow

Is This Language Regular or not?

https://www.generacodice.com/en/articolo/2204640/is-this-language-regular-or-not

  turing-machines  -  regular-language  -  nfa  -  decidable  -  context-free-language

StackOverflow

Is a CFG using a nil language decidable?

https://www.generacodice.com/en/articolo/1350359/is-a-cfg-using-a-nil-language-decidable

  turing-machines  -  context-free-grammar  -  decidable

StackOverflow

• «
• 1
• 2
• 3
• »

Results found: 22