✦ LIBER ✦

On well quaasiordering of finite languages

✍ Scribed by Martin Klazar

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 360 KB
Volume: 163
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00311-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Well Quasi Ordering Finite Posets and Fo

Well Quasi Ordering Finite Posets and Formal Languages

✍ J. Gustedt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB

On the family of finite index matrix lan

On the family of finite index matrix languages

✍ Gheorghe Páun 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 817 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.

Which finite monoids are syntactic monoi

Which finite monoids are syntactic monoids of rational ω-languages

✍ Phan Trung Huy; Igor Livotsky; Do Long Van 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 534 KB