Computer Science
Bader Abu Radi
  • Jerusalem, Israel
  • Member for 3 years, 11 months
Profile Activity
Stats
1,475
reputation
11k
reached
60
answers
2
questions
About

CS PhD student at the Hebrew University of Jerusalem. I like automata theory, and Dragonball Z (not necessarily in that order).

Communities (3)

Top network posts

1
gold badge
4
silver badges
18
bronze badges
View all badges

Top tags (42)

Score 28
Posts 20
Posts % 32
Score 20
Posts 11
Score 18
Posts 16
Score 18
Posts 12
Score 18
Posts 12
Score 17
Posts 10
View all tags →

Top posts (62)

All Questions Answers
Votes Newest
8 Why is this automaton considered DFA? Dec 26 '20
6 How to prove the class of regular languages is closed under 3MAJ? Feb 22
6 I'm trying to understand why every language has an infinite number of TMs that accept it Jan 1
3 Context free grammar for $L = \{w \text{ | }w \in \{a,b\}^*, |w|_a=|w|_b-1\}$ Jan 28
3 Pumping lemma: why x in ∣xy∣ ≤ p? Jan 4
3 Non-deterministic Büchi vs Rabin: Automaton size for LTL->automaton Dec 29 '20
3 Language Containment of Automata Dec 16 '20
2 Minimal DFA for $1\Sigma^*0$ Jan 19
2 Can you reduce every decidable language to a regular language? Jan 17
2 For every non-trivial language $A$ and every finite strict subset $B \subsetneq A$, it's holds that $A \le_m A \setminus B$ Jan 17
View all questions and answers →

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.