User zython

69

votes

4

answers

16k

views

What is the novelty in MapReduce?

Sep 8 '15 at 15:41 Alejandro Montenegro 1

50

votes

6

answers

13k

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

5k

views

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

lambda-calculus combinatory-logic

Aug 5 '19 at 11:58 Rodrigo de Azevedo 814

42

votes

4

answers

15k

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

39

votes

2

answers

6k

views

Are there inherently ambiguous and deterministic context-free languages?

formal-languages automata formal-grammars pushdown-automata

Jun 5 '14 at 3:12 vzn 10.7k

38

votes

6

answers

14k

views

Sorting functions by asymptotic growth

asymptotics landau-notation reference-question

Nov 11 '19 at 5:32 Community♦ 1

33

votes

2

answers

11k

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 Community♦ 1

30

votes

2

answers

6k

views

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

computability turing-machines combinatorics

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

24

votes

4

answers

75k

views

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

formal-languages regular-languages automata finite-automata

Jan 27 '20 at 18:36 reinierpost 4,015

24

votes

3

answers

10k

views

Pumping lemma for simple finite regular languages

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

Aug 31 '17 at 14:23 Community♦ 1

23

votes

1

answer

7k

views

How to show that L = L(G)?

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

Jun 13 '15 at 8:34 Community♦ 1

23

votes

1

answer

3k

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 9,139

17

votes

3

answers

38k

views

Infinite Language vs. finite language

formal-languages terminology regular-languages

May 24 '17 at 13:09 reinierpost 4,015

12

votes

2

answers

3k

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

8

votes

1

answer

5k

views

3-SAT for variables appearing 3 times

np-complete 3-sat

Oct 19 '15 at 14:03 Tom van der Zanden 12.7k

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 1,207

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 561

6

votes

2

answers

6k

views

How to show that L=(L)*?

formal-languages

Mar 1 '20 at 14:10 vonbrand 12.6k

6

votes

2

answers

328

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

613

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

Dec 29 at 6:49 Yuval Filmus 246k

4

votes

1

answer

1k

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 143

4

votes

1

answer

641

views

Basic Myhill-Nerode Theorem Practice

formal-languages regular-languages

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

4

votes

1

answer

5k

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♦ 69.3k

4

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 246k

4

votes

3

answers

294

views

Termination in infinite-time

algorithms complexity-theory time-complexity kolmogorov-complexity termination

Jan 7 '15 at 17:05 Jake 3,608

3

votes

3

answers

5k

views

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

formal-languages regular-languages

Jan 30 at 17:09 Shreesh 4,617

2

votes

1

answer

2k

views

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

reductions

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

2

votes

1

answer

3k

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 12.3k

2

votes

2

answers

1k

views

How do I use the Myhill-Nerode theorem to show that a language is not regular?

formal-languages regular-languages

Jan 16 at 7:05 Soumodev 21

2

votes

1

answer

831

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 78.6k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

39 Bookmarks

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

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

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

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

Pumping lemma for simple finite regular languages

How to show that L = L(G)?

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

Infinite Language vs. finite language

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

3-SAT for variables appearing 3 times

How are threads implemented in different OSs?

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

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?

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

Termination in infinite-time

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

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

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

How do I use the Myhill-Nerode theorem to show that a language is not regular?

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