License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2008.1743
URN: urn:nbn:de:0030-drops-17436
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1743/
Caucal, Didier
Boolean algebras of unambiguous context-free languages
Abstract
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.
BibTeX - Entry
@InProceedings{caucal:LIPIcs:2008:1743,
author = {Didier Caucal},
title = {{Boolean algebras of unambiguous context-free languages}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
pages = {83--94},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-08-8},
ISSN = {1868-8969},
year = {2008},
volume = {2},
editor = {Ramesh Hariharan and Madhavan Mukund and V Vinay},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1743},
URN = {urn:nbn:de:0030-drops-17436},
doi = {10.4230/LIPIcs.FSTTCS.2008.1743},
annote = {Keywords: Synchronization, deterministic graph grammars}
}
Keywords: |
|
Synchronization, deterministic graph grammars |
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science |
Issue Date: |
|
2008 |
Date of publication: |
|
05.12.2008 |