✦ LIBER ✦

Transposition errors in context-free languages

✍ Scribed by K. Humenik; R.S. Pinkham

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 789 KB
Volume: 18
Category: Article
ISSN: 0164-1212
DOI: 10.1016/0164-1212(92)90103-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Approximately matching context-free lang

Approximately matching context-free languages

✍ Gene Myers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 609 KB

On commutative context-free languages

✍ J. Beauquier; M. Blattner; M. Latteux 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 620 KB

Remarks about Commutative Context-Free L

Remarks about Commutative Context-Free Languages

✍ Juha Kortelainen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 205 KB

We prove that the complement of a commutative language L is context-free if the Parikh-map of L is a proper linear set. Some sharpenings to results considering the Fliess conjecture on commutative contextfree languages are given. A conjecture concerning commutative star languages is disproved by a c