StackOverflow Questions for Tag: computation-theory

Dima Yaglin

Reputation: 1

theory of computation - subset of unrecognizable language

computation-theory

Score: -3

Answers: 0

PermanentGuest

Reputation: 5331

Can compilers identify recursion issues in Template Meta programming?

c++templatestemplate-meta-programmingcomputation-theory

Score: 3

Answers: 6

Bob Dole

Reputation: 13

Ambiguous Regular Grammar?

grammarregular-languagecomputation-theoryformal-languages

Score: 1

Answers: 2

Chris

Reputation: 49

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

theoryregular-languageautomatadfacomputation-theory

Score: 3

Answers: 3

Faisal

Reputation: 45

Turing machine that adds two numbers in decimal notation

state-machinefinite-automatacomputation-theoryturing-machines

Score: 1

Answers: 2

Muhammad Asif Raza

Reputation: 677

Turing machine for addition and comparison of binary numbers

binaryautomatacomputation-theoryturing-machinesturing-complete

Score: 6

Answers: 3

Abhijith Madhav

Reputation: 2818

Context free grammar for non-palindrome

context-free-grammarcomputation-theory

Score: 9

Answers: 5

Mohd Amir

Reputation: 11

Parameter estimation of record value with R for Chen or Inverse Chen distribution

rcompiler-errorscomputation-theorymlesimulationx

Score: 1

Answers: 0

Gwin Lim

Reputation: 13

Turing Machine - Finding k-th element and move it to the front of the tape

functionencodingsimulatorcomputation-theoryturing-machines

Score: 1

Answers: 1

A_Pumpkin

Reputation: 51

NPDA for L= {w ∈ {a,b}*: number of a's is twice the number of b's}

computation-theory

Score: -1

Answers: 3

rjc810

Reputation: 495

Negative speed up in Amdahl's law?

parallel-processingcomputer-sciencecpu-architecturecomputation-theoryparallelism-amdahl

Score: 3

Answers: 2

user103421

Reputation: 1

What does this notation mean in a pushdown automaton?

compiler-constructioncomputation-theorypushdown-automaton

Score: 0

Answers: 2

carl

Reputation: 13

NPM Version Range Grammar not regular?

regexnpmsemantic-versioningcomputation-theory

Score: 1

Answers: 1

username123

Reputation: 983

Turing completeness of feed-forward neural networks?

machine-learningneural-networkdeep-learningcomputation-theory

Score: 0

Answers: 2

just coding

Reputation: 73

DFA for all binary strings having even number of 0's or contains exactly two 1's

computation-theorydfacomputation

Score: 2

Answers: 1

kw3rti

Reputation: 224

A Turing Machine that adds one to a binary number

binaryautomatacomputation-theoryturing-machines

Score: 0

Answers: 2

ShubhamNext

Reputation: 19

Turing Machine to generate Fibonacci number in unary

computation-theoryturing-machines

Score: 1

Answers: 1

Caffeine

Reputation: 455

Build enumerator (printer) for { 0 ^ (3 ^ n) | n >=0} with at most 10 states including print and halt, limited alphabet?

algorithmcomputation-theoryturing-machines

Score: 5

Answers: 2

Aldoras

Reputation: 121

Turing machine accepting perfect squares in unary notation

automatafinite-automatacomputation-theoryturing-machines

Score: 2

Answers: 2

Kieran Anderson

Reputation: 29

Constructing a Turing Machine that deletes every second input symbol and then merges remaining string into a string with no blank gaps

logicstate-machineautomatacomputation-theoryturing-machines

Score: 2

Answers: 2

PreviousPage 1Next

StackOverflow Questions for Tag: computation-theory

theory of computation - subset of unrecognizable language

Can compilers identify recursion issues in Template Meta programming?

Ambiguous Regular Grammar?

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

Turing machine that adds two numbers in decimal notation

Turing machine for addition and comparison of binary numbers

Context free grammar for non-palindrome

Parameter estimation of record value with R for Chen or Inverse Chen distribution

Turing Machine - Finding k-th element and move it to the front of the tape

NPDA for L= {w ∈ {a,b}*: number of a&#39;s is twice the number of b&#39;s}

Negative speed up in Amdahl&#39;s law?

What does this notation mean in a pushdown automaton?

NPM Version Range Grammar not regular?

Turing completeness of feed-forward neural networks?

DFA for all binary strings having even number of 0&#39;s or contains exactly two 1&#39;s

A Turing Machine that adds one to a binary number

Turing Machine to generate Fibonacci number in unary

Build enumerator (printer) for { 0 ^ (3 ^ n) | n &gt;=0} with at most 10 states including print and halt, limited alphabet?

Turing machine accepting perfect squares in unary notation

Constructing a Turing Machine that deletes every second input symbol and then merges remaining string into a string with no blank gaps

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

NPDA for L= {w ∈ {a,b}*: number of a's is twice the number of b's}

Negative speed up in Amdahl's law?

DFA for all binary strings having even number of 0's or contains exactly two 1's

Build enumerator (printer) for { 0 ^ (3 ^ n) | n >=0} with at most 10 states including print and halt, limited alphabet?