Boolean algebras of unambiguous context-free languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Boolean algebras of unambiguous context-free languages


Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown languages, or more generally families of languages accepted by pushdown automata whose stack height can be uniquely determined by the input word read so far. These ideas can be described as a notion of synchronization. In this paper we present an extension of synchronization to all context-free languages using graph grammars. This generalization allows one to define boolean algebras of non-deterministic but unambiguous context-free languages containing regular languages.
Fichier principal
Vignette du fichier
nonambi.pdf (140.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00867574 , version 1 (30-09-2013)



Didier Caucal. Boolean algebras of unambiguous context-free languages. FSTTCS 2008, Dec 2008, Bangalore, India. pp.83-94, ⟨10.4230/LIPIcs.FSTTCS.2008.1743⟩. ⟨hal-00867574⟩
121 View
110 Download



Gmail Facebook Twitter LinkedIn More