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

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

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...

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

If A is in RP and there is a polynomial time reduction from B to A then B in RP?...

eigenvectors created by numpy.linalg.eig have dots instead of data...

Is a*b* regular?...

SICP exercise 3.20 - understand the envrionmental diagram (missing binding in my diagram)...

What can NOT be described by a PCRE regex?...

Front-End and Back-End calculating different amounts? Should the calculation be done in the same pla...

Construct grammar given the following language {a^n b^m | n,m = 0,1,2,...,n <= 2m}...

Can ROM be called SAM(Sequential Access Memory)?...

Why is this an invalid Turing machine?...

Marker positioning in Linear Bounded Automata...

Prove that we can decide whether a Turing machine takes at least 100 steps on some input...

In Non-Deterministic Finite Automata (NFA), how is the next branch/transition selected when there ar...

construct a pushdown automata for L={a^mb^n where n<=m<=2n}?...

How to translate this description into a language?...

Turing machine with one state that converts binary to decimal...

Prefix of a string...

Recursive set or not...

How to define a function with Church numerals in lambda-terms?...

Implementation of a context-free grammar for logical operators with parentheses...

Computational cost of making Anagrams from two strings using symmetric difference in python...

Example problems not in P nor in NP-complete but in NP...

Is it possible to create an HTML quine?...

How do you prove whether a simple unmeaningful code is computable or not?...

How to get the second leftmost derivation in this example?...

Algorithmic Complexity Analysis: practically using Knuth's Ordinary Operations (oops) and Memory...

Pumping lemma for regular language...