Is a fully polynomial-time approximation scheme a polynomial-time approximation scheme...

Is the RE and the finite automata same?...

validate that deterministic finite automata transition function has exactly one output state for eac...

how do i represent transitions when writing a code for a dynamic DFA?...

A non-negative integer base 3...

Converting recursive solution to dynamic programming...

L = { <M> : TM does not accept any thing }...

Deriving a regular grammar for the language recognised by the Finite Automata...

Left-Linear and Right-Linear Grammars...

Construct nfa occuring strings over {0,1} such that some two 0's are seperated by a string of le...

Single storage value that can be interpreted to mean different things...

C implementation of exponentiation by squaring...

Simulating Non Deterministic Turing machine with Deterministic Turing machine [JFLAP]...

What does this mean "In the RAM model of computation, instructions are executed one after anoth...

DFA and Regular Expression...

How exactly do macros in a Turing Machine work?...

How does a pushdown automaton know how to read a palindrome?...

1^3^n for n>=1 turing machine...

How is Turing Machine which accepts nothing is not Recursively Enumerable?...

Pair of Zeros separated by 1's NFA?...

The VC dimension of hypothesis space H1 is larger than the VC dimension of hypothesis space H2...

What is it called if two versions of a program performs the same job, but does it using different co...

CAP theorem: Can I have Consistency and Availability at same time...

Complexity of algorithms and complexity of problems. What are the differences?...

is it possible to find the md5 hash of a password without out actually having the original password...

Proof the undecidability of a function (using empty/non-empty intersection)...

Finding a complement of a regular language...

How to create a pushdown automata which accepts a language?...

Proof semidecidable languages...

Activating AND nodes and OR nodes...