✦ LIBER ✦

Borel hierarchy and omega context free languages

✍ Scribed by Olivier Finkel

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 214 KB
Volume: 290
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00042-7

No coin nor oath required. For personal study only.

✦ Synopsis

We give in this paper additional answers to questions of Lescow and Thomas (A decade of

📜 SIMILAR VOLUMES

On omega context free languages which ar

On omega context free languages which are Borel sets of infinite rank

✍ Olivier Finkel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 296 KB

This paper is a continuation of the study of topological properties of omega context free languages (!-CFL). We proved in (Topological properties of omega context free languages, Theoretical Computer Science, 262 (1-2) (2001) 669-697) that the class of !-CFL exhausts the ÿnite ranks of the Borel hie

An hierarchy between context-free and co

An hierarchy between context-free and context-sensitive languages

✍ Takumi Kasai 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 718 KB

Infinite subfamilies ~l, ~ .... , -oq'~o, .W,~ of the family consisting of contextsensitive languages, are introduced such that .2'~ ~z~ ..-C ~| ~o,where 9 LP a is the family of e-free context-free languages, Ld,o is the family of context-sensitive languages, and each L/', is an Abstract Family of L

Ambiguity in omega context free language

Ambiguity in omega context free languages

✍ Olivier Finkel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 522 KB

We extend the well-known notions of ambiguity and of degrees of ambiguity of ÿnitary context free languages to the case of omega context free languages (!-CFL) accepted by B uchi or Muller pushdown automata. We show that these notions may be deÿned independently of the B uchi or Muller acceptance co

A hierarchy of deterministic context-fre

A hierarchy of deterministic context-free ω-languages

✍ J. Duparc 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Subclasses of Linear Context—Free Langua

Subclasses of Linear Context—Free Languages and Homomorphic Characterizations of Languages

✍ Satoshi Okawa; Sadaki Hirose 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

Context-free languages and random walks

Context-free languages and random walks on groups

✍ Wolfgang Woess 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 435 KB

The Green function of an arbitrary, finitely supported random walk on a discrete group with context-free word problem is algebraic. It is shown how this theorem can be deduced from basic results of formal language theory. Context-free groups are precisely the finite extensions of free groups.