Constructing a realtime deterministic pushdown automaton from a grammar

Jan Pittl*, Amiram Yehudai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


A new direct construction from a grammar to a realtime deterministic pushdown automation is presented. The grammar is required to be in a special form, but the construction is more natural than previously known constructions. As a result the family of stack uniform strict deterministic languages can be characterized by a grammar family.

Original languageEnglish
Pages (from-to)57-69
Number of pages13
JournalTheoretical Computer Science
Issue number1-2
StatePublished - 1983


Dive into the research topics of 'Constructing a realtime deterministic pushdown automaton from a grammar'. Together they form a unique fingerprint.

Cite this