Theoretical Computer Science
J.-E. Pin
  • Paris
  • Member for 8 years, 2 months
Profile Activity
Stats
4,641
reputation
119k
reached
52
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.
24
silver badges
40
bronze badges
Top tags
View all 44 tags
262
Score
36
Posts
64
Posts %
191
Score
27
Posts
48
Posts %
115
Score
16
Posts
29
Posts %
79
Score
12
Posts
21
Posts %
52
Score
5
Posts
9
Posts %
38
Score
5
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
25
Complexity zoo for unary languages
May 11 '15
18
Deciding whether a unary context-sensitive language is regular
Jun 20 '16
16
Major unsolved problems in theoretical computer science?
Aug 8 '13
16
Hierarchies in regular languages
Oct 27 '16
14
Algorithm for ranking members of a regular language?
Aug 9 '13
14
Multi-language DFA minimisation
Aug 27 '13
14
Measurability of an $\omega$-regular language
Aug 6 '13
13
Can I show algebraically that this regular expression accepts all binary strings?
Aug 16 '13
13
Minimizing Automata accepting $\omega$-words (i.e. infinite words)
Jan 4 '15
13
"Embedding" a language in itself
Jun 20 '15
Top network posts
View all
45
Why is Lebesgue so often spelled "Lebesque"?
40
I get a wrong determinant - why?
30
Why does intersection always preserve "closed" structures?
21
How to create DFA from regular expression without using NFA?
20
subset of binary space countable?

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.