Document Open Access Logo

Boolean algebras of unambiguous context-free languages

Author Didier Caucal

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2008.1743.pdf
  • Filesize: 437 kB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • Synchronization
  • deterministic graph grammars

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Didier Caucal. Boolean algebras of unambiguous context-free languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 83-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1743

Author Details

Didier Caucal
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact