# Identifying and describing the language accepted by a Turing machine [closed]

Given a Turing machine, how can I identify the language it accepts and write a set notation for L(M)?

## closed as too broad by David Richerby, D.W.♦, Ran G., Nicholas Mancuso, JuhoMay 13 '15 at 7:36

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

• You identify the langauge in the same way that you identify what any computer program does: study it and figure it out. How to write something using set notation is an exceptionally broad question. Bear in mind that descriptions of languages aren't unique: there's more than one way to describe a set and any reasonably concise, unambiguous description will do. – David Richerby May 12 '15 at 8:25

$M$ is a TM such that $L(M)=\left \{ x\in \Sigma^* \ | \ |x|\in \mathbb{N}_{even}\right \}$. Which is usually the case.