Formal languages
On the power of synchronization in parallel computations
Discrete Applied Mathematics - Formal language theory
Theoretical Computer Science
Deterministic versus nondeterministic space in terms of synchronized alternating machines
Theoretical Computer Science
A shrinking lemma for indexed languages
Theoretical Computer Science
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Mathematical Theory of L Systems
Mathematical Theory of L Systems
The generative capacity of block-synchronized context-free grammars
Theoretical Computer Science
Descriptional complexity of block-synchronization context-free grammars
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Hi-index | 0.00 |
Synchronized context-free grammars are special context-free grammars together with a relation which must be satisfied between every pair of paths from root to leaf in a derivation tree, in order to contribute towards the generated language. In the past, only the equality relation and the prefix relation have been studied, with both methods generating exactly the ET0L languages. In this paper, we study arbitrary relations, and in particular, those defined by a transducer. We show that if we use arbitrary a-transducers, we can generate all recursively enumerable languages, and moreover, there exists a single fixed transducer, even over a two letter alphabet, which allows to generate all recursively enumerable languages. We also study the problem over unary transducers. Although it is left open whether or not we can generate all recursively enumerable languages with unary transducers, we are able to demonstrate that we can generate all ET0L languages as well as a language that is not an indexed language. Only by varying the transducer used to define the relation, this generalization is natural, and can give each of the following language families: context-free languages, a family between the E0L and ET0L languages, ET0L languages, and recursively enumerable languages.