On reversal bounded alternating Turing machines
type: Item
instance of: scholarly article
title: On reversal bounded alternating Turing machines
zbMATH Open document ID: 0643.68065
DOI: 10.1016/0304-3975(87)90138-1
author: Maciej Liśkiewicz
author: Krzysztof Loryś
author: Marek Piotrów
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 4049058
zbMATH Keywords: space complexity
zbMATH Keywords: reversal complexity
zbMATH Keywords: alternating Turing machines
zbMATH Keywords: regular languages
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90138-1
OpenAlex ID: W1983106665
cites work: Reversal-bounded multipushdown machines
cites work: Reversal-Bounded Acceptors and Intersections of Linear Languages
cites work: Alternation
cites work: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
cites work: The reduction of tape reversals for off-line one-tape Turing machines
cites work: Finite-Turn Pushdown Automata
cites work: Tape-reversal bounded Turing machine computations
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Note on tape reversal complexity of languages
cites work: On alternation
cites work: A characterization of reversal-bounded multipushdown machine languages
cites work: Q3707407
description: scientific article; zbMATH DE number 4049058