Talk:Omega language

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Computing

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.

Philosophy: Logic Low‑importance

This article is within the scope of WikiProject Philosophy, a collaborative effort to improve the coverage of content related to philosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join the general discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy articles

Low

This article has been rated as Low-importance on the project's importance scale.

Associated task forces:
/
	Logic

How can membership of $\omega$-regular languages be decidable? edit

Latest comment: 5 years ago2 comments2 people in discussion

If you say something is decidable unqualified then that means it's decidable by a Turing Machine. There is no way that membership of the language $\{a\}^\omega$ over the alphabet $\Sigma=\{a,b\}$ is decidable by a Turing machine. The articles on similar topics seem to make similar dubious or incorrect claims. — Preceding unsigned comment added by 62.172.100.253 (talk) 17:04, 2 January 2018 (UTC)Reply

It's perfectly standard usage to extend the concept of decidability to other models of computation. See paragraph 2 of Recursive language. In this case, as the text explains, these languages are decidable with a Buchi automaton. — Preceding unsigned comment added by 131.252.62.244 (talk) 16:51, 18 October 2018 (UTC)Reply

Add topic