Constructing a realtime deterministic pushdown automaton from a grammar
type: Item
instance of: scholarly article
title: Constructing a realtime deterministic pushdown automaton from a grammar
zbMATH Open document ID: 0514.68076
DOI: 10.1016/0304-3975(83)90138-X
author: Jan Pitti
author: Amiram Yehudai
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3812984
zbMATH Keywords: realtime deterministic pushdown automaton
zbMATH Keywords: grammar family
zbMATH Keywords: stack uniform
MaRDI profile type: Publication
cites work: The inclusion problem for simple languages
cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
cites work: Economy of description by parsers, DPDA's, and PDA's
cites work: Q4198075
cites work: Real-Time Strict Deterministic Languages
cites work: Strict deterministic grammars
cites work: Two decidability results for deterministic pushdown automata
cites work: Context-free grammars: covers, normal forms, and parsing
cites work: The equivalence problem for real-time strict deterministic languages
cites work: Q4171567
cites work: Q3922198
description: scientific article; zbMATH DE number 3812984