Theoretical Computer Science
user avatar
user avatar
user avatar
Michaël Cadilhac
  • Member for 11 years, 10 months
  • Last seen this week
Profile Activity

20 Answers

Score Activity Newest
30 votes

What papers should everyone read?

20 votes

What videos should everybody watch?

16 votes

(False?) proof for computability of a function?

15 votes
Accepted

Regular language that discriminates between two deterministic CFGs

14 votes
Accepted

Finding a finite model

12 votes
Accepted

LogDCFL-complete problems

11 votes

On the realisation of monoids as syntactic monoids of languages

11 votes
Accepted

Is the complement of { www | … } context-free?

9 votes
Accepted

A reference for a "more algebraic" approach to pushdown automata and CFLs?

8 votes
Accepted

Is it decidable whether the output length of a transducer is bounded by the input length?

8 votes

Does there exist a hardest DCFL?

8 votes
Accepted

Is there an example of a non context-sensitive language?

6 votes

Survey Article on the Theory of Recursive Functions?

6 votes

Reductions from the book.

6 votes
Accepted

For which $R$ is $\{0^a10^b10^c\mid R(a,b,c)\}$ context-free?

5 votes
Accepted

What language $L \in NCM$ has $\overline{L} \not \in NCM$?

5 votes

Dinner-table description of theoretical computer science?

3 votes
Accepted

Are Reversal-bounded Multicounter Machines closed under reversal?

2 votes

Regular expressions aren't

1 vote

Image processing algorithms

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.