Stack Exchange Network

Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
  1. 0
  2. +0
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company
    • Business Learn more about hiring developers or posting ads with us
  3. Log in Sign up
  4. current community

    • Computer Science
      help chat
    • Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
Computer Science
  1. Home
    1. Questions
    2. Tags
    3. Users
    4. Unanswered
    5. Jobs
Profile Activity
Meta user
Network profile
zython

Reputation

347
  • 347
  • 342
  • 337
  • Jun
  • Sep
  • Dec
  • Mar

Top tag

computability

Next privilege

500 Rep.
Access review queues

Badges

2
12

Newest

 Popular Question

Next badge

0/1
Critic

Impact

~4k
people reached
0 posts edited
6 helpful flags
40 votes cast
Summary Answers Questions Tags Badges Bookmarks Bounties Reputation All actions

39 Bookmarks

Votes Activity Newest Views Added
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
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 : L*L* = 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
1
2 Next
Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
  • Mobile
Company
  • Stack Overflow
  • For Teams
  • Advertise With Us
  • Hire a Developer
  • Developer Jobs
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
Stack Exchange
Network
  • Technology
  • Life / Arts
  • Culture / Recreation
  • Science
  • Other
  • Stack Overflow
  • Server Fault
  • Super User
  • Web Applications
  • Ask Ubuntu
  • Webmasters
  • Game Development
  • TeX - LaTeX
  • Software Engineering
  • Unix & Linux
  • Ask Different (Apple)
  • WordPress Development
  • Geographic Information Systems
  • Electrical Engineering
  • Android Enthusiasts
  • Information Security
  • Database Administrators
  • Drupal Answers
  • SharePoint
  • User Experience
  • Mathematica
  • Salesforce
  • ExpressionEngine® Answers
  • Stack Overflow em Português
  • Blender
  • Network Engineering
  • Cryptography
  • Code Review
  • Magento
  • Software Recommendations
  • Signal Processing
  • Emacs
  • Raspberry Pi
  • Stack Overflow на русском
  • Code Golf
  • Stack Overflow en español
  • Ethereum
  • Data Science
  • Arduino
  • Bitcoin
  • Software Quality Assurance & Testing
  • Sound Design
  • Windows Phone
  • more (28)
  • Photography
  • Science Fiction & Fantasy
  • Graphic Design
  • Movies & TV
  • Music: Practice & Theory
  • Worldbuilding
  • Video Production
  • Seasoned Advice (cooking)
  • Home Improvement
  • Personal Finance & Money
  • Academia
  • Law
  • Physical Fitness
  • Gardening & Landscaping
  • Parenting
  • more (10)
  • English Language & Usage
  • Skeptics
  • Mi Yodeya (Judaism)
  • Travel
  • Christianity
  • English Language Learners
  • Japanese Language
  • Chinese Language
  • French Language
  • German Language
  • Biblical Hermeneutics
  • History
  • Spanish Language
  • Islam
  • Русский язык
  • Russian Language
  • Arqade (gaming)
  • Bicycles
  • Role-playing Games
  • Anime & Manga
  • Puzzling
  • Motor Vehicle Maintenance & Repair
  • Board & Card Games
  • Bricks
  • Homebrewing
  • Martial Arts
  • The Great Outdoors
  • Poker
  • Chess
  • Sports
  • more (16)
  • MathOverflow
  • Mathematics
  • Cross Validated (stats)
  • Theoretical Computer Science
  • Physics
  • Chemistry
  • Biology
  • Computer Science
  • Philosophy
  • Linguistics
  • Psychology & Neuroscience
  • Computational Science
  • more (10)
  • Meta Stack Exchange
  • Stack Apps
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

site design / logo © 2021 Stack Exchange Inc; user contributions licensed under cc by-sa. rev 2021.3.3.38704