✦ LIBER ✦

Approximately matching context-free languages

✍ Scribed by Gene Myers

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 609 KB
Volume: 54
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00007-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On commutative context-free languages

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

Molecular Query Language (MQL) — A Conte

Molecular Query Language (MQL) — A Context-Free Grammar for Substructure Matching.

✍ Ewgenij Proschak; Joerg K. Wegner; Andreas Schueller; Gisbert Schneider; Uli Fec 📂 Article 📅 2007 🏛 John Wiley and Sons ⚖ 11 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

A note on context-free languages

✍ R.F.C. Walters 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Context-Free Languages of Sub-exponentia

Context-Free Languages of Sub-exponential Growth

✍ Martin R. Bridson; Robert H. Gilman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Logical Description of Context-free Grap

Logical Description of Context-free Graph Languages

✍ Joost Engelfriet; Vincent van Oostrom 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 378 KB