computation-theory

computation-theory

Grammar for a^n

Prove that a PDA with k stacks is Turing-Recognisable

NP and 3-SAT and One Facts

Is Computationally-hard is same as NP-hard?

Pumping Lemma for languages with no order

Languages to context free grammars

What will be the DFA for (0+1)*?

Subset Sum theory and solutions [closed]

Regular languages & Proofs (models of computation) [closed]

Drawing a simple non-deterministic finite automaton (NFA)

is X^n more efficient than X^(1/n)? (n being integer)

Computability: Is the language of DFAs that receive even-length words in P?

Construct a DFA for the following language: L={a^n b^n | n>=1}

Prove that the set of all languages over a finite alphabet is uncountable

Kolmogorov complexity

Does Provable == Decidable?

page:2 of 2 prev page main page

Categories

react-calendar-timeline

javascript-debugger

high-availability

apache-kafka-connect

inventory-management

sql-server-profiler

mongodb-nodejs-driver

software-distribution

google-closure-library

tekton-pipelines

jboss-developer-studio

producer-consumer

google-geocoder

angular-auth-oidc-client

ruby-on-rails-2

start-stop-daemon

universal-image-loader

uitextfielddelegate

collectionviewsource

formsauthentication

database-cloning

Resources