✦ LIBER ✦

It is decidable whether a regular language is pure context-free

✍ Scribed by W. Bucher; J. Hagauer

Book ID: 107948502
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 785 KB
Volume: 26
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90088-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

It is decidable whether a monadic thue s

It is decidable whether a monadic thue system is canonical over a regular set

✍ Paliath Narendran 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 596 KB

On deciding whether a monoid is a free m

On deciding whether a monoid is a free monoid or is a group

✍ F. Otto 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 624 KB

The D0L-ness for context-free languages

The D0L-ness for context-free languages is decidable

✍ M. Linna 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Algorithmic ways of deciding whether an

Algorithmic ways of deciding whether an infinite language is a code

✍ N. Z. Gabbasov 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 196 KB

English Is Not a Context-Free Language

✍ James Higginbotham 📂 Article 📅 1984 🏛 MIT Press 🌐 English ⚖ 914 KB

It is decidable whether the image of an

It is decidable whether the image of an N-rational sequence has a base

✍ Juha Honkala 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We give a method to decide whether or not the image of a given N-rational sequence can be recognized in some base. In the positive case the bases can be computed effectively.