Constructing a realtime deterministic pushdown automaton from a grammar

Jan Pittl; Amiram Yehudai

doi:10.1016/0304-3975(83)90138-X

Constructing a realtime deterministic pushdown automaton from a grammar

Jan Pittl^*, Amiram Yehudai

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	57-69
Number of pages	13
Journal	Theoretical Computer Science
Volume	22
Issue number	1-2
DOIs	https://doi.org/10.1016/0304-3975(83)90138-X
State	Published - 1983

Access to Document

10.1016/0304-3975(83)90138-X

Cite this

@article{7d57b863fb48415097066bb53f1d392a,

title = "Constructing a realtime deterministic pushdown automaton from a grammar",

abstract = "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.",

author = "Jan Pittl and Amiram Yehudai",

year = "1983",

doi = "10.1016/0304-3975(83)90138-X",

language = "אנגלית",

volume = "22",

pages = "57--69",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Constructing a realtime deterministic pushdown automaton from a grammar

AU - Pittl, Jan

AU - Yehudai, Amiram

PY - 1983

Y1 - 1983

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49049127004&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(83)90138-X

DO - 10.1016/0304-3975(83)90138-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:49049127004

SN - 0304-3975

VL - 22

SP - 57

EP - 69

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Constructing a realtime deterministic pushdown automaton from a grammar

Abstract

Access to Document

Other files and links

Fingerprint

Cite this