✦ LIBER ✦

String and graph grammar characterizations of bounded regular languages

✍ Scribed by Kenneth B. Salomon

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Prefix grammars: an alternative characte

✍ Michael Frazier; C. David Page Jr 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A regular characterization of graph lang

✍ Joost Engelfriet 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Maximum matchings in a regular graph of

✍ P. Katerinis 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

Applying a logical interpretation of sem

✍ Eero Hyvönen 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 471 KB

Exponential upper and lower bounds for t

✍ Andreas Weber 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Characterization and construction of Cay

✍ Robert Jajcay 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 754 KB