User zython

67

votes

4

answers

16k

views

What is the novelty in MapReduce?

Sep 8 '15 at 15:41 Alejandro Montenegro 1

49

votes

6

answers

11k

views

Why are some games np-complete?

complexity-theory np-complete computer-games

Feb 12 '17 at 20:07 MaxW 101

44

votes

2

answers

4k

views

How does the Y combinator exemplify “Lambda calculus inconsistency”?

lambda-calculus combinatory-logic

Aug 5 at 11:58 Rodrigo de Azevedo 758

39

votes

4

answers

12k

views

What are common techniques for reducing problems to each other?

complexity-theory computability reductions proof-techniques reference-question

Jan 17 '14 at 18:09 Community♦ 1

36

votes

2

answers

5k

views

Are there inherently ambiguous and deterministic context-free languages?

formal-languages automata formal-grammars pushdown-automata

Jun 5 '14 at 3:12 vzn 9,614

35

votes

6

answers

9k

views

Sorting functions by asymptotic growth

asymptotics landau-notation reference-question

Oct 19 '18 at 6:19 kelalaka 682

28

votes

2

answers

5k

views

Why are there more non-computable functions than computable ones?

computability turing-machines combinatorics

Feb 11 '13 at 5:56 Raphael♦ 59.1k

27

votes

2

answers

6k

views

How do I construct reductions between problems to prove a problem is NP-complete?

complexity-theory np-complete proof-techniques reductions

May 5 '18 at 11:18 nbro 654

21

votes

1

answer

5k

views

How to show that L = L(G)?

formal-languages formal-grammars proof-techniques reference-question

Jun 13 '15 at 8:34 Community♦ 1

21

votes

1

answer

2k

views

Decide whether a context-free languages can be accepted by a deterministic pushdown automaton

automata context-free pushdown-automata

May 23 '12 at 13:37 jmad 8,697

19

votes

3

answers

7k

views

Pumping lemma for simple finite regular languages

formal-languages regular-languages pumping-lemma finite-sets

Aug 31 '17 at 14:23 Raphael♦ 59.1k

18

votes

4

answers

54k

views

How to show that a “reversed” regular language is regular

formal-languages regular-languages automata finite-automata

Sep 10 at 17:55 Shi Yangyi 3

14

votes

3

answers

28k

views

Infinite Language vs. finite language

formal-languages terminology regular-languages

May 24 '17 at 13:09 reinierpost 3,387

12

votes

2

answers

2k

views

If $L$ is a subset of $\{0\}^$, then how can we show that $L^$ is regular?

formal-languages regular-languages

Feb 21 '13 at 23:18 Community♦ 1

7

votes

3

answers

1k

views

Will $L = \{a^* b^*\}$ be classified as a regular language?

formal-languages regular-languages kleene-star

Jun 4 '16 at 14:00 Alwyn Mathew 556

7

votes

1

answer

2k

views

How are threads implemented in different OSs?

operating-systems process-scheduling threads

Jun 7 '12 at 23:11 Ankit 627

6

votes

2

answers

4k

views

How to show that L=(L)*?

formal-languages

Jan 30 '13 at 15:33 Stephen 162

6

votes

2

answers

309

views

Grammatical characterization of deterministic context-free languages

reference-request formal-grammars context-free

Apr 5 '13 at 9:56 franklyn 1

5

votes

1

answer

302

views

Why is $\{a^n b^m c^p: n\neq m\} \cup \{a^n b^m c^p: m\neq p\}$ an inherently ambiguous language?

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

Mar 22 '15 at 19:27 Yuval Filmus 209k

5

votes

1

answer

3k

views

3-SAT for variables appearing 3 times

np-complete 3-sat

Oct 19 '15 at 14:03 Tom van der Zanden 9,613

4

votes

3

answers

240

views

Termination in infinite-time

algorithms complexity-theory time-complexity kolmogorov-complexity termination

Jan 7 '15 at 17:05 Jake 2,336

4

votes

1

answer

796

views

Non-regularity of the set of primes in unary encoding using Myhill-Nerode

formal-languages regular-languages

Mar 8 '16 at 17:50 Marek Židek 123

4

votes

1

answer

473

views

Basic Myhill-Nerode Theorem Practice

formal-languages regular-languages

Oct 17 '15 at 10:37 Raphael♦ 59.1k

4

votes

1

answer

4k

views

Can you recognize or decide if a Turing Machine has an infinite sized language?

computability turing-machines undecidability semi-decidability

May 6 '14 at 20:43 Raphael♦ 59.1k

3

votes

1

answer

2k

views

Showing that the pumping lemma cannot prove that some language is not regular

formal-languages pumping-lemma

Jul 16 '15 at 21:51 Yuval Filmus 209k

3

votes

3

answers

3k

views

Using Myhill-Nerode to prove a language is non-regular

formal-languages regular-languages

Feb 13 '18 at 9:02 Discrete lizard♦ 5,357

2

votes

1

answer

2k

views

Proving that {0^{2^k}} is not regular with the Myhill-Nerode theorem [duplicate]

formal-languages regular-languages

Feb 12 '14 at 20:42 Patrick87 10.6k

2

votes

1

answer

491

views

Pumping Lemma: Is language with equal number of “aa” and “bb” regular?

regular-languages pumping-lemma

Feb 16 '17 at 8:47 David Richerby 75.5k

2

votes

2

answers

961

views

Use the pumping lemma to show the language is not regular

formal-languages regular-languages pumping-lemma

Dec 16 '17 at 5:49 Yuval Filmus 209k

2

votes

1

answer

1k

views

Reduction between $\Sigma^*$ and $\emptyset$

reductions

Jan 9 '14 at 23:06 Raphael♦ 59.1k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

39 Favorites

What is the novelty in MapReduce?

Why are some games np-complete?

How does the Y combinator exemplify “Lambda calculus inconsistency”?

What are common techniques for reducing problems to each other?

Are there inherently ambiguous and deterministic context-free languages?

Sorting functions by asymptotic growth

Why are there more non-computable functions than computable ones?

How do I construct reductions between problems to prove a problem is NP-complete?

How to show that L = L(G)?

Decide whether a context-free languages can be accepted by a deterministic pushdown automaton

Pumping lemma for simple finite regular languages

How to show that a “reversed” regular language is regular

Infinite Language vs. finite language

If $L$ is a subset of $\{0\}^$, then how can we show that $L^$ is regular?

Will $L = \{a^* b^*\}$ be classified as a regular language?

How are threads implemented in different OSs?

How to show that L=(L)*?

Grammatical characterization of deterministic context-free languages

Why is $\{a^n b^m c^p: n\neq m\} \cup \{a^n b^m c^p: m\neq p\}$ an inherently ambiguous language?

3-SAT for variables appearing 3 times

Termination in infinite-time

Non-regularity of the set of primes in unary encoding using Myhill-Nerode

Basic Myhill-Nerode Theorem Practice

Can you recognize or decide if a Turing Machine has an infinite sized language?

Showing that the pumping lemma cannot prove that some language is not regular

Using Myhill-Nerode to prove a language is non-regular

Proving that {0^{2^k}} is not regular with the Myhill-Nerode theorem [duplicate]

Pumping Lemma: Is language with equal number of “aa” and “bb” regular?

Use the pumping lemma to show the language is not regular

Reduction between $\Sigma^*$ and $\emptyset$