User zython

24

votes

4

answers

75k

views

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

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

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

69

votes

4

answers

16k

views

What is the novelty in MapReduce?

algorithms distributed-systems parallel-computing algorithm-design

Sep 8 '15 at 15:41 Alejandro Montenegro 1

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

38

votes

6

answers

14k

views

Sorting functions by asymptotic growth

asymptotics landau-notation reference-question

Nov 11 '19 at 5:32 Community♦ 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

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

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

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

6

votes

2

answers

6k

views

How to show that L=(L)*?

formal-languages

Mar 1 '20 at 14:10 vonbrand 12.6k

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

2

votes

2

answers

5k

views

Is the language TMs that accept finite languages Turing-recognizable?

computability turing-machines semi-decidability

Nov 2 '15 at 20:08 Community♦ 1

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

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

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

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

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

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

1

vote

1

answer

3k

views

How to prove Transitive property of Reducibility with a TM?

computability turing-machines reductions

Aug 22 '13 at 14:32 Raphael♦ 69.3k

0

votes

2

answers

3k

views

Can $\emptyset$ be reducible to any other language? [duplicate]

computability reductions

Apr 26 '19 at 15:44 John L. 24.8k

0

votes

2

answers

3k

views

Proving that $S^* = (S^)^$

regular-languages proof-techniques induction

Apr 19 at 10:04 Juho 20.7k

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

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

2

votes

1

answer

2k

views

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

reductions

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

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

-1

votes

1

answer

2k

views

Kleene Star Property : LL = L* [closed]

formal-languages

Mar 12 '14 at 11:15 FrankW 6,471

2

votes

2

answers

2k

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

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

1

vote

3

answers

1k

views

Proving a Language is Irregular using Myhill-Nerode

formal-languages

Sep 30 '13 at 21:57 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

39 Bookmarks

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

Infinite Language vs. finite language

What is the novelty in MapReduce?

What are common techniques for reducing problems to each other?

Sorting functions by asymptotic growth

Why are some games np-complete?

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

Pumping lemma for simple finite regular languages

How to show that L = L(G)?

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

How to show that L=(L)*?

Are there inherently ambiguous and deterministic context-free languages?

Is the language TMs that accept finite languages Turing-recognizable?

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

3-SAT for variables appearing 3 times

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

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

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

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

How to prove Transitive property of Reducibility with a TM?

Can $\emptyset$ be reducible to any other language? [duplicate]

Proving that $S^* = (S^)^$

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

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

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

How are threads implemented in different OSs?

Kleene Star Property : LL = L* [closed]

Use the pumping lemma to show the language is not regular

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

Proving a Language is Irregular using Myhill-Nerode