Pushdown automata with bounded nondeterminism and bounded ambiguity
type: Item
instance of: scholarly article
title: Pushdown automata with bounded nondeterminism and bounded ambiguity
zbMATH Open document ID: 0901.68132
DOI: 10.1016/S0304-3975(96)00267-8
author: Christian Herzog
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1177893
zbMATH Keywords: pushdown automata
MaRDI profile type: Publication
cites work: On measuring nondeterminism in regular languages
cites work: Q4198075
cites work: Q5592246
cites work: Refining nondeterminism in context-free languages
cites work: Amounts of nondeterminism in finite automata
cites work: Q4266531
cites work: Q4431342
cites work: Succinctness of Descriptions of Unambiguous Context-Free Languages
cites work: A note on the succinctness of descriptions of deterministic languages
cites work: Q3309067
full work available at URL: s0304-3975(96)00267-8
OpenAlex ID: W2632078856
description: scientific article; zbMATH DE number 1177893