Profile Activity

mrjasmin

Network profile

Reputation

506

506
433
360

2017
2018
2019
2020

Top tag

finite-automata

Next privilege

1,000 Rep.

See votes

Badges

1

4

12

Newest

Famous Question

Next badge

0/1

Impact

0 posts edited

0 helpful flags

19 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

12 Questions

Views Newest Activity Votes

3

votes

1

answer

2k

views

LR(1) - Items, Look Ahead

formal-languages formal-grammars context-free parsing

Jan 28 '14 at 11:28 Angelo Borsotti 1

1

3

votes

2

answers

4k

views

DFA - Equivalence classes

formal-languages finite-automata

Aug 30 '13 at 10:45 mrjasmin 506

2

votes

5

answers

11k

views

Explaining why a grammar is not LL(1)

formal-languages regular-languages context-free pushdown-automata

Jul 13 at 9:41 Digvijay Ambule 1

2

votes

1

answer

123

views

Pumping lemma problem

formal-languages automata context-free pumping-lemma

Jan 4 '13 at 20:59 Karolis Juodelė 3,507

1

vote

3

answers

208

views

Deciding if language is Context-Free

formal-languages context-free

Aug 28 '13 at 10:32 Community♦ 1

1

1

vote

1

answer

488

views

Deciding whether a Language is Context-free/Regular/Non Context-Free

formal-languages regular-languages context-free

May 25 '13 at 13:29 Community♦ 1

1

vote

1

answer

780

views

Pumping lemma problem - Choosing the right string to pump

formal-languages automata context-free pumping-lemma

Jan 4 '13 at 9:46 A.Schulz 11.5k

3

1

vote

1

answer

525

views

Pumping lemma for Context-Free Languages

formal-languages formal-grammars context-free pumping-lemma

Jan 3 '13 at 22:51 Yuval Filmus 217k

0

votes

1

answer

74

views

Deciding the class of certain languages [closed]

formal-languages context-free automata

Oct 14 '13 at 20:20 Gilles 'SO- stop being evil' 37.8k

0

votes

2

answers

561

views

Bayesian Network - Inference

probability-theory

Aug 20 '13 at 20:50 mrjasmin 506

-1

votes

1

answer

211

views

Time Complexity of Algorithm

algorithms algorithm-analysis runtime-analysis

Sep 16 '13 at 7:43 Raphael♦ 67.2k

-1

votes

1

answer

1k

views

Formal Languages - Expressive power of Formalisms

formal-languages regular-languages context-free regular-expressions pushdown-automata

Jan 1 '13 at 22:35 Hendrik Jan 23.4k

Computer Science Stack Exchange works best with JavaScript enabled