e/Alternating Turing machine

Information
has gloss	eng: In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer in 1976 (see References).
lexicalization	eng: Alternating turing machine
instance of	e/Computational model

Meaning
German
lexicalization	deu: Alternierende Turingmaschine
Croatian
has gloss	hrv: U računskoj teoriji složenosti, alternirajući Turingov stroj je nedeterministički Turingov stroj (ATS) sa pravilom prihvaćanja izračunavanja koje poopćava pravila korištena u definiciji klasa složenosti NP i co-NP. Koncept ATS su postavili Chandra i Stockmeyer 1976. (vidjeti reference).
lexicalization	hrv: alternirajući Turingov stroj
Japanese
has gloss	jpn: 交替性チューリング機械（こうたいせいチューリングきかい、）は、非決定性チューリング機械 (NTM) の一種であり、複雑性クラス NP および co-NP の定義で使われる規則を一般化した計算受理規則を持つ。1976年、Chandra と Stockmeyer が ATM の概念を定式化した。
lexicalization	jpn: 交替性チューリング機械