Can one find out which input characters matched which part of a regex?...

Is { w | w <> w^R } over the alphabet {0,1} a context-free language?...

Regular languages & Proofs (models of computation)...

How come we write programs in context-free languages? Shouldn't programs be in recursively enume...

Real numbers comparison...

2 Player Game is Polynomial Space complete...

Why do so many things run in 'human observable time'?...

Regular Expression that matches based on differences in 1's in 0's in a binary string...

Subroutine inference...

Computability: Is the language of DFAs that receive even-length words in P?...

Writing a program that writes a program...

there's a way to sort a regular expressions list by specificity?...

A very complex problem in reduction notion...

Computational Learning theory based on PAC-learning framework...

How to tell if a machine is Turing machine equivalent...

Precise Input Size and Time Complexity...

Minimizing Finite State Automaton...

Can a Turing machine be constructed having only two tape symbols?...

Design a language L such that neither L nor its complement has an infinite regular subset?...

Prove that the set of regular languages is a proper subset of the set of the context-free languages...

Context-free grammar for a language...

Context free grammars...

Does Provable == Decidable?...

Decide if number is negative (in URM machine like language)...

Pac-Man representation with Finite State Automaton...

Regular Expression for numerical constant...

Good resources to learn about models of computation?...

What is the name of a function whose result depends only on its parameters?...