Network profile

Mary Star

Reputation

421

2018
2019
2020
2021

Top tag

formal-languages

Next privilege

500 Rep.

Access review queues

Badges

Newest

Notable Question

Next badge

0/1

Impact

0 posts edited

0 helpful flags

85 votes cast

20 Questions

Votes Activity Newest Views

votes

answers

views

Reducing Exact Cover to Subset Sum

Nov 29 '17 at 13:57 Community♦ 1

votes

answer

views

Cases of Master Theorem

proof-techniques recurrence-relation master-theorem

Jun 27 '15 at 6:12 Yuval Filmus 246k

votes

answer

347

views

Reduce our problem to a known np-complete problem

complexity-theory np-complete reductions decision-problem

Apr 13 '15 at 10:04 Raphael♦ 69.2k

votes

answers

215

views

Counterexample that B-A can be NOT context free

formal-languages

Feb 3 '14 at 16:02 Mary Star 421

vote

answer

views

The algorithm yields optimal ternary codes

algorithms data-compression heaps

Nov 26 '18 at 0:40 Tom Zych 254

vote

answers

468

views

Construction of a Turing machine

turing-machines

Jul 24 '17 at 17:25 Mary Star 421

vote

answers

160

views

Implementation of function [closed]

algorithms computation-models

Dec 21 '16 at 0:00 Mary Star 421

vote

answers

views

Undecidability of an existential theory

computability undecidability first-order-logic

Aug 23 '15 at 18:19 Community♦ 1

vote

answers

616

views

Reachability matrix in time $O(|V| \cdot |E|)$

algorithms algorithm-analysis graphs

Apr 16 '15 at 16:54 Mary Star 421

vote

answers

112

views

Are regular languages closed against an intersection that keeps words with the same number of ones?

formal-languages regular-languages closure-properties

Mar 2 '15 at 14:36 J.-E. Pin 5,516

vote

answers

views

Language accepted by a RAM

computability

Oct 16 '14 at 12:45 David Richerby 78.6k

votes

answers

views

Total weight of Huffman Code

discrete-mathematics weighted-graphs coding-theory huffman-coding

Jun 5 at 19:07 Mary Star 421

votes

answers

views

Constructible enumerable set

algorithms computability turing-machines enumeration

Oct 1 '17 at 5:00 George Greene 1

votes

answer

107

views

What does the algorithm calculate?

algorithms correctness-proof loop-invariants

Jan 18 '17 at 6:59 Raphael♦ 69.2k

votes

answers

151

views

Representation of the number in two's complement

arithmetic numeral-representations

Dec 21 '16 at 6:14 Raphael♦ 69.2k

votes

answer

503

views

What is a Huffman tree for a Block-Code?

data-structures trees binary-trees huffman-coding

Dec 7 '16 at 23:06 Mary Star 421

votes

answer

views

What are activation records?

terminology programming-languages compilers recursion stacks

Oct 13 '14 at 11:42 babou 18.5k

-1

votes

answers

views

Find the optimal way [closed]

complexity-theory optimization traveling-salesman

Jul 28 '16 at 3:20 Mary Star 421

-1

votes

answer

224

views

Pumping lemma for {w | w = ddd}

context-free pumping-lemma

Dec 27 '13 at 18:21 Community♦ 1

-1

votes

answer

183

views

Modified Pumping Lemma

regular-languages

Dec 16 '13 at 2:18 Ran G. 19.4k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

20 Questions

Reducing Exact Cover to Subset Sum

Cases of Master Theorem

Reduce our problem to a known np-complete problem

Counterexample that B-A can be NOT context free

The algorithm yields optimal ternary codes

Construction of a Turing machine

Implementation of function [closed]

Undecidability of an existential theory

Reachability matrix in time $O(|V| \cdot |E|)$

Are regular languages closed against an intersection that keeps words with the same number of ones?

Language accepted by a RAM

Total weight of Huffman Code

Constructible enumerable set

What does the algorithm calculate?

Representation of the number in two's complement

What is a Huffman tree for a Block-Code?

What are activation records?

Find the optimal way [closed]

Pumping lemma for {w | w = ddd}

Modified Pumping Lemma