On the complexity of \(\omega\)-type Turing acceptors
type: Item
instance of: scholarly article
title: On the complexity of \(\omega\)-type Turing acceptors
zbMATH Open document ID: 0432.68040
DOI: 10.1016/0304-3975(80)90049-3
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3673534
zbMATH Keywords: Turing acceptors
zbMATH Keywords: infinite computations
zbMATH Keywords: complexity classes
author: Rina S. Cohen
author: Arie Y. Gold
MaRDI profile type: Publication
full work available at URL: 0304-3975(80)90049-3
OpenAlex ID: W67599404
cites work: Q4138104
cites work: Q5517677
cites work: Theories of automata on \(\omega\)-tapes: a simplified approach
cites work: Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
cites work: Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
cites work: \(\omega\)-computations on deterministic pushdown machines
cites work: \(\omega\)-computations on Turing machines
cites work: Q4136519
cites work: Q4159365
cites work: Q5592246
cites work: Decision problems forω-automata
cites work: On ω-sets associated with context-free languages
cites work: A decidability result for deterministic \(\omega\)-context-free languages
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q4116078
cites work: A Mathematical Theory of Communication
description: scientific article; zbMATH DE number 3673534