Length synchronization context-free grammars

Authors:
Mutyam Madhu;Kamala Krithivasan
Affiliations:
International Institute of Information Technology, Gachibowli, Hyderabad, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2004

Citing 6
Cited 2

On the power of synchronization in parallel computations

Discrete Applied Mathematics - Formal language theory
Synchronized tree automata

Theoretical Computer Science
Deterministic versus nondeterministic space in terms of synchronized alternating machines

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems

Mathematical Theory of L Systems

An infinite hierarchy induced by depth synchronization

Theoretical Computer Science
On the synchronized derivation depth of context-free grammars

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new type of regulation on the derivation of a context-free grammar: the productions used for passing from a level of a derivation tree to the next level should have the right-hand members of the same length. We prove that such length synchronized context-free grammars characterize the family of ETOL languages, and therefore are equivalent with the synchronization context-free grammars of H. Jüirgensen and K. Salomaa. In this way, a conjecture of H. Jürgensen and K. Salomaa is disproved, about a language which was conjectured not to be generated by a synchronization context-free grammar.