✦ LIBER ✦

Decision problems concerning thinness and slenderness of formal languages

✍ Scribed by Juha Honkala

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 116 KB
Volume: 35
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s002360050134

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Problems of inclusion and equivalence fo

Problems of inclusion and equivalence for program schemata and formal languages

✍ L. P. Lisovik 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 750 KB

Algorithms for producing grammars from s

Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology

✍ Horacio Feliciangeli; Gabor T. Herman 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 926 KB

We give a number of algorithms which for a finite set of finite sequences of strings of symbols decide whether or not there exists a grammar of a certain fixed type such that each of the sequences is a derivation (or subderivation) by the grammar. Whenever such grammars exist, our algorithms will ef