𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Refining nondeterminism in context-free languages

✍ Scribed by Chandra M. R. Kintala

Publisher
Springer
Year
1978
Tongue
English
Weight
537 KB
Volume
12
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bracketed context-free languages
Bracketed context-free languages
✍ Seymour Ginsburg; Michael A. Harrison πŸ“‚ Article πŸ“… 1967 πŸ› Elsevier Science 🌐 English βš– 1012 KB

A bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection

Ambiguity in omega context free language
Ambiguity in omega context free languages
✍ Olivier Finkel πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 522 KB

We extend the well-known notions of ambiguity and of degrees of ambiguity of ΓΏnitary context free languages to the case of omega context free languages (!-CFL) accepted by B uchi or Muller pushdown automata. We show that these notions may be deΓΏned independently of the B uchi or Muller acceptance co

Length considerations in context-free la
Length considerations in context-free languages
✍ Danny Raz πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 905 KB

In this paper we investigate languages containing at most a bounded number of words of each length. We first show that the context-free languages for which the number of words of every length is bounded by a fixed polynomial are exactly the bounded context-free languages in the sense of . Thus, we p

On commutative context-free languages
On commutative context-free languages
✍ J. Beauquier; M. Blattner; M. Latteux πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 620 KB