Synchronization of Grammars

  • Didier Caucal
  • Stéphane Hassen
Conference paper

DOI: 10.1007/978-3-540-79709-8_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)
Cite this paper as:
Caucal D., Hassen S. (2008) Synchronization of Grammars. In: Hirsch E.A., Razborov A.A., Semenov A., Slissenko A. (eds) Computer Science – Theory and Applications. CSR 2008. Lecture Notes in Computer Science, vol 5010. Springer, Berlin, Heidelberg

Abstract

Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata. The languages recognized by grammars synchronized by a given grammar form an effective boolean algebra lying between regular languages and deterministic context-free languages. We also provide a sufficient condition to obtain the closure under concatenation and its iteration.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Didier Caucal
    • 1
  • Stéphane Hassen
    • 2
  1. 1.IGM–CNRS 
  2. 2.IREMIA 

Personalised recommendations