CforLinux 's user avatar
CforLinux 's user avatar
CforLinux 's user avatar
CforLinux
  • Member for 2 years, 11 months
  • Last seen more than a month ago
3 votes
1 answer
45 views

Build an automaton from a given automaton to prove regularity of more complex strings

3 votes
2 answers
486 views

How to build a deterministic finite automaton from a given one with a new definition for automaton language?

2 votes
2 answers
93 views

Prove irregularity of a language using closure properties

2 votes
1 answer
42 views

Irregularity of $\{b^ma^n: (m,n)=1\}$ using Nerode [closed]

1 vote
2 answers
279 views

sort array with some of the elements in a known range

1 vote
2 answers
31 views

Construct a regular expression for a specified language

1 vote
1 answer
126 views

Enumerator for $L=\{0^{3^n}| n\ge 0\}$

0 votes
0 answers
16 views

$A\in LSPACE \Longrightarrow CYCLE(A)\in LSPACE$

0 votes
0 answers
96 views

BST deletion of node with 2 children by copying right child to predecessor

0 votes
1 answer
76 views

Finding 2 nodes which sum equals twice their common ancestor in RBT in $\Theta(n\lg n)$

0 votes
0 answers
180 views

Create a data structure with D-SUCCESSOR running in $O(1)$

0 votes
0 answers
90 views

Calculating the expected height of a randomly built binary search tree

0 votes
1 answer
117 views

updating n elements in $O(\lg{n})$ time

0 votes
0 answers
36 views

prove the intersection of a positive closure of a non-regular language and a finite language is a regular language

0 votes
0 answers
148 views

Defining grammar for $L=\{a^ib^ic^jd^j| i \ge j \ge 0\}$

0 votes
0 answers
150 views

Is there linear solution for the hotel problem