Stack Exchange Network

Stack Exchange network consists of 181 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…
    • 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 our products
  1. current community

    • Theoretical Computer Science
      help chat
    • Theoretical Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  2. Log in
  3. Sign up
Theoretical Computer Science
  1. Home
    1. Public
    2. Questions
    3. Tags
    4. Users
    5. Companies
    6. Unanswered
    1. Teams
      Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
    2. Teams
    3. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more about Teams
user avatar
user avatar
user avatar
C.P.
  • Member for 9 years
  • Last seen more than 1 year ago
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

6 Answers

Score Activity Newest
3 votes

k-testable languages with non-constant k?

reference-request fl.formal-languages
answered Jun 9, 2019 at 16:42
2 votes

Example of monoid $M$ such that $\operatorname{RAT}(M) \not\subseteq \operatorname{REC}(M)$

fl.formal-languages automata-theory regular-language algebra monoid
answered Jun 6, 2018 at 9:45
4 votes

Closure of Recognizable Languages under Kleene Star: Algebraic Proof?

automata-theory
answered Jun 5, 2018 at 7:49
2 votes

Are there non-constructive proofs of existence of "small" Turing machines / NFAs?

cc.complexity-theory automata-theory turing-machines
answered Oct 3, 2016 at 4:40
17 votes
Accepted

Regular versus TC0

cc.complexity-theory fl.formal-languages automata-theory circuit-complexity regular-language
answered Jan 2, 2016 at 18:21
3 votes

Size hierachy for uniform circuits

circuit-complexity uniformity hierarchy-theorems
answered Aug 19, 2013 at 0:34
Theoretical Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2022 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2022.8.12.42806

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.