Mathematics
Peter Leupold's user avatar
Peter Leupold's user avatar
Peter Leupold's user avatar
Peter Leupold
  • Member for 5 years, 10 months
  • Last seen more than a month ago
Profile Activity
Stats
1,220
reputation
33k
reached
76
answers
1
question
Communities
View all
Badges
View all badges
1
gold badge
6
silver badges
8
bronze badges
Top tags
View all tags
41
Score
50
Posts
65
Posts %
23
Score
30
Posts
39
Posts %
16
Score
19
Posts
25
Posts %
13
Score
13
Posts
17
Posts %
12
Score
19
Posts
25
Posts %
8
Score
8
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
3
Function that maps strings from one formal language into string of another formal language?
May 16, 2019
answer
3
Prove that the following language is decidable / undecidable
Apr 15, 2019
answer
2
Every infinite Turing-recognizable language has an infinite decidable subset
Nov 12, 2021
answer
2
Exitstance of DPA of L = $\{ww^r\}$
Jan 14, 2018
answer
2
Are the following regular expressions equivalent?
Dec 2, 2019
answer
2
Finite State Automaton for the language over $ \{0,1\}: $ $k^{th}$ last index is $1$
May 9, 2019
answer
2
Why is this language not Regular - w^Rw (i.e. a word concat. with its reverse)?
May 21, 2018
answer
2
Are context free languages closed under taking substring?
Jul 31, 2018
answer
2
The formal language $L$ is regular iff there is a "reduced" NFA
Mar 15, 2019
answer
2
Give an example of a language $L$ where $\min(\max L)\neq \max(\min L)$
Jan 29, 2019
Top network posts
View all network posts
10
How can I tell that a language is context-free from first sight?
10
Known and described subclasses of Context-Free Grammars class
7
Are there protein-based computational models?

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.