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 10 years, 4 months
  • Last seen this week
  • Paris
Profile Activity
Stats
6,014
reputation
484k
reached
140
answers
1
question
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.
18
silver badges
36
bronze badges
Top tags
View all tags
277
Score
63
Posts
45
Posts %
231
Score
56
Posts
40
Posts %
180
Score
45
Posts
32
Posts %
171
Score
51
Posts
36
Posts %
97
Score
25
Posts
18
Posts %
50
Score
10
Posts
7
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
21
How to create DFA from regular expression without using NFA?
Mar 28, 2015
answer
15
Star free language vs. regular language
Aug 16, 2013
answer
13
Importance of the empty string
Jan 5, 2014
answer
13
Algorithm to test whether a language is regular
Nov 14, 2013
answer
13
Bridge theorems for group theory and formal languages
Sep 18, 2013
answer
13
NFA with exponential number of states when determinized
Oct 21, 2013
answer
12
How to prove a language is regular?
Sep 20, 2013
answer
12
Can we make a non-regular language regular via concatentation?
Mar 30, 2016
answer
9
Decidability of "Is this regular expression prefix-free?"
Apr 9, 2015
answer
8
DFA for accepting all binary strings of form power of $n$ (not divisible by $n$) i.e. $n^k$ for given $n$
Jan 23, 2016
Top network posts
View all network posts
47
Why is Lebesgue so often spelled "Lebesque"?
40
I get a wrong determinant - why?
31
Why does intersection always preserve "closed" structures?
25
Complexity zoo for unary languages
21
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.