✦ LIBER ✦

Commutative closure of context-free languages

✍ Scribed by L. P. Lisovik

Publisher: Springer US
Year: 1979
Tongue: English
Weight: 746 KB
Volume: 14
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069829

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The commutative closure of a binary slip

The commutative closure of a binary slip-language is context-free: a new proof

✍ Michel Rigo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 133 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

The Boolean closure of linear context-fr

The Boolean closure of linear context-free languages

✍ Martin Kutrib; Andreas Malcher; Detlef Wotschke 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 321 KB

Commutative closure of regular semigroup

Commutative closure of regular semigroups of languages

✍ M. S. L'vov 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 444 KB

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