Computer Science
user5721565's user avatar
user5721565's user avatar
user5721565's user avatar
user5721565
  • Member for 5 years, 8 months
  • Last seen more than 1 year ago
Profile Activity

8 Questions

Score Activity Newest Views
3 votes
1 answer
1k views

$L$ is a context free language so prefix$(L)$ is also a context free language

0 votes
1 answer
647 views

what are the conditions for two NFAs to be equivalent?

2 votes
1 answer
195 views

Using B+Tree to implement index, when the index-key size and the data-block size are of the same order

0 votes
0 answers
145 views

proving an automaton language for the language over $\{a,b\}^{*}$ : $w\in L$ if $aa$ is not an infix of $w$ ($aa$ doesn't appear in $w$)

3 votes
1 answer
128 views

Are the languages $\{w\in \{a,b\}^* : \#_a(w) > \#_b(w) \}$ and $\{w\in \{a,b\}^* : \#_a(w) \neq \#_b(w) \}$ context free?

3 votes
1 answer
124 views

$a_k$ is $\{L :\exists M$ a pushdown automaton with bounded stack of size $k$ which accept $L\}$ what is the set $\bigcup_1^\infty a_k$?

0 votes
1 answer
57 views

How to build a TM which decides $L_k := \{(\langle M \rangle ,x)\in HP : |(\langle M \rangle ,x)| \le k \}$

0 votes
0 answers
38 views

A condition for $\emptyset \neq S\subset RE$ under which $L_S \notin RE$