Publication detail

Canonical Scattered Context Generators of Sentences with Their Parses

MEDUNA, A. TECHET, J.

Original Title

Canonical Scattered Context Generators of Sentences with Their Parses

English Title

Canonical Scattered Context Generators of Sentences with Their Parses

Type

journal article - other

Language

en

Original Abstract

Scattered context generators derive their sentences followed by the corresponding parses. This paper discusses their two canonical versions, which make this derivation either in a leftmost or rightmost way. It demonstrates that for every recursively enumerable language, L, there exists a canonical scattered context generator whose language consists of L's sentences followed by their parses. In fact, this result is established based on the generators containing no more than six nonterminals.

English abstract

Scattered context generators derive their sentences followed by the corresponding parses. This paper discusses their two canonical versions, which make this derivation either in a leftmost or rightmost way. It demonstrates that for every recursively enumerable language, L, there exists a canonical scattered context generator whose language consists of L's sentences followed by their parses. In fact, this result is established based on the generators containing no more than six nonterminals.

Keywords

scattered context grammars, canonical derivations, parses, descriptional complexity

RIV year

2007

Released

10.12.2007

Pages from

73

Pages to

81

Pages count

9

BibTex


@article{BUT45163,
  author="Alexandr {Meduna} and Jiří {Techet}",
  title="Canonical Scattered Context Generators of Sentences with Their Parses",
  annote="Scattered context generators derive their sentences followed by the corresponding
parses. This paper discusses their two canonical versions, which make this
derivation either in a leftmost or rightmost way. It demonstrates that for every
recursively enumerable language, L, there exists a canonical scattered context
generator whose language consists of L's sentences followed by their parses. In
fact, this result is established based on the generators containing no more than
six nonterminals.",
  chapter="45163",
  howpublished="print",
  journal="Theoretical Computer Science",
  number="389",
  volume="2007",
  year="2007",
  month="december",
  pages="73--81",
  type="journal article - other"
}