A characterization of exponential-time languages by alternating context- free grammars
type: Item
instance of: scholarly article
title: A characterization of exponential-time languages by alternating context- free grammars
zbMATH Open document ID: 0774.68073
DOI: 10.1016/0304-3975(92)90355-J
author: Oscar H. Ibarra
author: Tao Jiang
author: Hui Wang
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 65336
zbMATH Keywords: exponential-time languages
zbMATH Keywords: alternating pushdown automata
zbMATH Keywords: linear-erasing alternating context-free grammars
MaRDI profile type: Publication
cites work: Alternation
cites work: Q5592246
cites work: On the power of alternation in automata theory
cites work: The Power of Alternating One-Reversal Counters and Stacks
cites work: Alternating Pushdown and Stack Automata
cites work: Alternation bounded auxiliary pushdown automata
cites work: A grammatical characterization of alternating pushdown automata
cites work: On the generative power of transformational grammars
full work available at URL: 0304-3975(92)90355-j
OpenAlex ID: W2083245182
description: scientific article; zbMATH DE number 65336