Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CSR
2008
Springer

favoriteEmaildiscussreport

118views Theoretical Computer Science» more CSR 2008»

Synchronization of Grammars

13 years 6 months ago

Synchronization of Grammars

Download www-igm.univ-mlv.fr

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.

Didier Caucal, Stéphane Hassen

Real-time Traffic

CSR 2008 | Deterministic Graph Grammars | Height-deterministic Pushdown Automata | Pushdown Automata | Theoretical Computer Science |

claim paper

Related Content

» A Statistical Machine Translation Model Based on a Synthetic Synchronous Grammar

» Synchronization of Regular Automata

» Generalized Multitext Grammars

» Correcting Errors in a Treebank Based on Synchronous Tree Substitution Grammar

» A Gibbs Sampler for Phrasal Synchronous Grammar Induction

» Issues Concerning Decoding with Synchronous Contextfree Grammar

» Machine Translation Based on ConstraintBased Synchronous Grammar

» Comparative Parser Performance Analysis across Grammar Frameworks through Automatic Tree C...

» Learning Synchronous Grammars for Semantic Parsing with Lambda Calculus

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CSR
Authors	Didier Caucal, Stéphane Hassen

Comments (0)