Search code examples
Turing machine for addition and comparison of binary numbers...


binaryautomatacomputation-theoryturing-machinesturing-complete

Read More
Context free grammar for non-palindrome...


context-free-grammarcomputation-theory

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


functionencodingsimulatorcomputation-theoryturing-machines

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


computation-theory

Read More
Negative speed up in Amdahl's law?...


parallel-processingcomputer-sciencecpu-architecturecomputation-theoryparallelism-amdahl

Read More
NPM Version Range Grammar not regular?...


regexnpmsemantic-versioningcomputation-theory

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


computation-theorydfacomputation

Read More
a challenging finite automata - what is the language?...


statestate-machinecomputation-theoryfinite-automatadfa

Read More
how to find the grammar of this Language?...


palindromecontext-free-grammarcomputation-theorychomsky-normal-formchomsky-hierarchy

Read More
Complexity/decidability of the "nested maze" problem?...


time-complexitycomputation-theory

Read More
Designing a Turing Machine's state table...


automataturing-machinescomputation-theory

Read More
Conversion of NFA having a missing transition for any input character on initial state to DFA...


computer-sciencecomputation-theoryfinite-automatadfanfa

Read More
What is the context free grammar for the complement of the double word over 0,1?...


context-free-grammarcomputation-theory

Read More
Is constexpr-based computation Turing complete?...


c++c++11metaprogrammingcomputation-theoryconstexpr

Read More
Searching Algorithm: Product Knapsack Problem with goal to find lowest product above a certain thres...


algorithmknapsack-problemcomputation-theorynp

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


computation-theory

Read More
Is it possible to write a program with thousand or fewer characters that can generate every possible...


computation-theory

Read More
Minimum number of states in a DFA having '1' as the 5th symbol from right...


finite-automatadfacomputation-theory

Read More
Closure property of regular languages under concatenation and star operation...


closuresregular-languagecomputation-theory

Read More
What is the optimum known upper bound on Kolmogorov complexity?...


algorithmcompressioncomputation-theoryinformation-theory

Read More
What is the industry standard for number of clusters for a development team in Databricks?...


apache-sparkpysparkdatabricksazure-databrickscomputation-theory

Read More
Using string of set length with pumping lemma to prove irregularity...


regular-languagecomputation-theorypumping-lemma

Read More
Is it possible to write a prolog interpreter that avoids infinite recursion?...


prologcomplexity-theorycomputation-theoryprolog-metainterpreter

Read More
C++ code example that makes the compile loop forever...


c++computation-theoryformal-languagesautomata-theory

Read More
Inversion Counting Algorithm implementation in Python,cannot unpack non-iterable int object...


pythonalgorithmcomputer-sciencedivide-and-conquercomputation-theory

Read More
Confusion about NP-hard and NP-Complete in Traveling Salesman problems...


time-complexitycomplexity-theorycomputation-theorynpnon-deterministic

Read More
NFA that does not accept strings ending "101"...


computation-theoryfinite-automatanfanon-deterministic

Read More
Design a PDA of all strings of 0's and 1's that are not of the form ww^R...


automatacomputation-theorypushdown-automaton

Read More
why a^m b^n where m,n > 0 is a regular language but a^n b^n where n > 0 is non regular languag...


regexregular-languagecomputation-theoryfinite-automata

Read More
Writing lambda calculus higher order recursion scheme in Haskell...


haskellrecursiontypeslambda-calculuscomputation-theory

Read More
BackNext