Theoretical Computer Science
J.-E. Pin's user avatar
J.-E. Pin's user avatar
J.-E. Pin's user avatar
J.-E. Pin
  • Member for 9 years, 9 months
  • Last seen more than a week ago
  • Paris
Profile Activity
Stats
4,761
reputation
126k
reached
53
answers
4
questions
Communities
View all
About

Research interests. Algebraic theory of automata and languages. In particular, connections with semigroup theory, combinatorics, logic and topology.

Badges
View all badges
This user doesn’t have any gold badges yet.
25
silver badges
42
bronze badges
Top tags
View all tags
265
Score
36
Posts
63
Posts %
203
Score
28
Posts
49
Posts %
116
Score
16
Posts
28
Posts %
87
Score
13
Posts
23
Posts %
52
Score
5
Posts
9
Posts %
38
Score
5
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
25
Complexity zoo for unary languages
May 11, 2015
question
18
Deciding whether a unary context-sensitive language is regular
Jun 20, 2016
answer
16
Major unsolved problems in theoretical computer science?
Aug 8, 2013
answer
16
Hierarchies in regular languages
Oct 27, 2016
answer
14
Algorithm for ranking members of a regular language?
Aug 9, 2013
answer
14
Multi-language DFA minimisation
Aug 27, 2013
answer
14
Measurability of an $\omega$-regular language
Aug 6, 2013
answer
13
Can I show algebraically that this regular expression accepts all binary strings?
Aug 16, 2013
answer
13
Minimizing Automata accepting $\omega$-words (i.e. infinite words)
Jan 4, 2015
answer
13
"Embedding" a language in itself
Jun 20, 2015
Top network posts
View all network posts
47
Why is Lebesgue so often spelled "Lebesque"?
40
I get a wrong determinant - why?
30
Why does intersection always preserve "closed" structures?
21
subset of binary space countable?
21
How to create DFA from regular expression without using NFA?

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.