Is there a difference between a "finite state machine" and a "state machine"?...

Subtle nuances of Big O notation for computation complexity...

How can a Stack of Push Down Automata accept a string of Indefinitely Large?...

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

Aren't the von Neumann model and the Turing model practically the the same thing?...

Is the given language a valid CFG?...

Can the unreachable state removed in this minimized DFA?...

can i push two symbols to the stack of a pushdown automata?...

What is the result of this CFG?...

Can I have a faster nested loop just lowering the algorithm complexity?...

Is this grammar LR(2) and how can i determine it?...

Classical molecular dynmaics...

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

Hash function for two integer arrays with minimal collisions...

What are the theoretical upper limits on parallelizability?...

Checking whether a function is computable or not...

optimal maximum difference within subarrays...

Does there exist a regular language that's not Turing Recognizable?...

What are the chances of a 1 + 1 sum giving the wrong result?...

Solving and proving a DFA that subtracts and takes the modulus of two elements...

Design a FA to accept L, where L = Strings in which ‘a’ always appears tripled...

How to demonstrate the correctness of a program with a while cycle using Hoare's logic?...

Is it possible for an ambiguous CFG convert into CNF and becomes unambiguous?...

Approximating longest cycle in a directed graph...

How do you divide the string in pumping lemma?...

Is union is regular expression different from union in set?...

Computational arithmetic - how many bits exactly for 8 digit number needed...

m to the power of 0 in Church’s Numerals...

how do we prove that this language is irregular using the pumping lemma?...

Difference between Turing-Decidable and Co-Turing-Decidable...