An Observation on Relative Parsing Time

Bertsch, Eberhard

doi:10.1145/321906.321912

Cited by 22 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…E. Bertsch has shown that the resuit is true for réductions [3], Thus the theorem follows if we can show the resuit under the additional assumption that (p is a simulation.…”

Section: Tjffiorem 2 : If Cp : G 1 -> G 2 Is An Expanding Transformatmentioning

confidence: 80%

See 1 more Smart Citation

The behaviour of parsing time under grammar morphisms

Walter¹,

Keklikoglou²,

Kern³

1978

RAIRO. Inform. théor.

View full text Add to dashboard Cite

“…E. Bertsch has shown that the resuit is true for réductions [3], Thus the theorem follows if we can show the resuit under the additional assumption that (p is a simulation.…”

Section: Tjffiorem 2 : If Cp : G 1 -> G 2 Is An Expanding Transformatmentioning

confidence: 80%

“…E. Bertsch [3] has shown, that parsing time is preserved applying strictly length-preserving morphisms to context-free grammars. We generalize this resuit to a class of grammar morphisms which is much more greater.…”

Section: Introductionmentioning

confidence: 99%

The behaviour of parsing time under grammar morphisms

Walter¹,

Keklikoglou²,

Kern³

1978

RAIRO. Inform. théor.

View full text Add to dashboard Cite

“…By way of analogy with a strict interpretation of a context-free grammar [1,3], Wood [7] discussed a strict interpretation of a pda. We now recall that notion and, in Section 2, examine it with respect to dpda.…”

Section: Prefiminariesmentioning

confidence: 99%

“…We now turn to closure properties of ~s(M) for a deterministic pda M. Let M be the obvious dpda which accepts the set (aibicJ/i, j> 1) u {dieJfJ/i, (2) 6n contains only those instructions as given by (1). Clearly M n is a dpda and it is straightforward to verify that L(Mn)= Let …”

Section: I~'s(z) ---{ Z'u/uc_ (2th~ads X/z(e/) X/~3(~) For Some @ Inmentioning

confidence: 99%

Strict interpretations of deterministic pushdown acceptors

Ginsburg

Kintala²

1981

Math. Systems Theory

View full text Add to dashboard Cite

Abstract. Three results are established. The first is that every nondeterministic strict interpretation of a deterministic pushdown acceptor (dpda) has an equivalent, deterministic, strict interpretation. The second is that if M~ and M 2 are two compatible strict interpretations of the dpda M, then there exist deterministic strict interpretations M n and M u such that L(Mn)=L(MI)N L(M2) and L(Mu)=L(M1)U L(M2). The third states that there is no dpda whose strict interpretations yield all the deterministic context-free languages.

show abstract

“…The approach taken in [6] should be compared with the pioneering paper of Cremers and Ginsburg [2] for (context-free) grammar forms. Apart from the underlying rewriting System being an EOL System rather than a (context-free) grammar, the major distinction is the restriction of interprétations of EOL forms to be strict interprétations in the grammar form framework, see [1] and [4]. In a recent paper [5], strict interprétations for non-context-free grammar forms have been investigated.…”

Section: Introductionmentioning

confidence: 99%