Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in computation-theory

How to tell if a machine is Turing machine equivalent

Guidance on Algorithmic Thinking (4 fours equation)

Subroutine inference

Can someone give a simple but non-toy example of a context-sensitive grammar? [closed]

Pumping lemma for regular language

Count all subsets of an array where the largest number is the sum of the remaining numbers

Real world uses of DFA,NFA,PDA and Turing machines

Right way to discuss computational complexity for small n

Does Provable == Decidable?

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

How to write an enumeration of all computable functions?

Is a*b* regular?

Is C# 4.0 compile-time turing complete?

Context free grammar for non-palindrome

Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s

what are these arrow operators in context free grammar?

Confusion about NP-hard and NP-Complete in Traveling Salesman problems

Understanding recognizers and deciders in Theory of Computation

How to calculate function points [closed]

NFA to DFA question