User zython

17

votes

4

answers

54k

views

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

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,367

67

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

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

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

35

votes

6

answers

9k

views

Sorting functions by asymptotic growth

asymptotics landau-notation reference-question

Oct 19 '18 at 6:19 kelalaka 682

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

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

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

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,604

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

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

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

2

votes

2

answers

4k

views

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

computability turing-machines semi-decidability

Nov 2 '15 at 20:08 Community♦ 1

6

votes

2

answers

4k

views

How to show that L=(L)*?

formal-languages

Jan 30 '13 at 15:33 Stephen 162

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

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,347

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

-1

votes

1

answer

3k

views

induction proof for kleene star

regular-languages proof-techniques induction

Nov 16 '17 at 18:44 Knvl Sh 1

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

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

0

votes

2

answers

2k

views

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

computability reductions

Apr 26 at 15:44 Apass.Jack 19.4k

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

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

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

2

votes

1

answer

1k

views

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

reductions

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

-1

votes

1

answer

1k

views

Kleene Star Property : LL = L* [closed]

formal-languages

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

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

1

vote

3

answers

1k

views

Proving a Language is Irregular using Myhill-Nerode

formal-languages

Sep 30 '13 at 21:57 Community♦ 1

2

votes

2

answers

942

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

39 Favorites

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?

Why are some games np-complete?

Sorting functions by asymptotic growth

Pumping lemma for simple finite regular languages

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

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

Are there inherently ambiguous and deterministic context-free languages?

How to show that L = L(G)?

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

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

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

How to show that L=(L)*?

3-SAT for variables appearing 3 times

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

How to prove Transitive property of Reducibility with a TM?

induction proof for kleene star

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

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

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

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

How are threads implemented in different OSs?

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

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

Kleene Star Property : LL = L* [closed]

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

Proving a Language is Irregular using Myhill-Nerode

Use the pumping lemma to show the language is not regular