✦ LIBER ✦

On the family of finite index matrix languages

✍ Scribed by Gheorghe Páun

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 817 KB
Volume: 18
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90035-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On well quaasiordering of finite languag

On well quaasiordering of finite languages

✍ Martin Klazar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

On the index of positive programmed form

On the index of positive programmed formal languages

✍ Guozhu Dong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Finite Languages for the Representation

Finite Languages for the Representation of Finite Graphs

✍ Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We introduce a new way of specifying graphs: through languages, i.e., sets of strings. The strings of a given (finite, prefix-free) language represent the vertices of the graph; whether or not there is an edge between the vertices represented by two strings is determined by the pair of symbols at th

On the Languages Representable by Finite

On the Languages Representable by Finite Probabilistic Automata

✍ Phan Dinh Diêu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 837 KB

The complexity of countable categoricity

The complexity of countable categoricity in finite languages

✍ Aleksander Ivanov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.

Language of the Earth || Names Index

✍ Rhodes, Frank H.T.; Stone, Richard O.; Malamud, Bruce D. 📂 Article 📅 2008 🏛 Blackwell Publishing, Ltd ⚖ 82 KB