Abstract
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.
Research supported, in part, by the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A.V.: Indexed grammars—an extension of context-free grammars. J. ACM 15(4), 647–671 (1968)
Bordihn, H., Holzer, M.: On the computational complexity of synchronized context-free languages. J. Univ. Comput. Sci. 8(2), 119–140 (2002)
Gilman, R.H.: A shrinking lemma for indexed languages. Theoret. Comput. Sci. 163(1-2), 277–281 (1996)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Hromkovič, J., Karhumäki, J., Rovan, B., Slobodová, A.: On the power of synchronization in parallel computations. Discrete Appl. Math. 32, 155–182 (1991)
Hromkovič, J., Rovan, B., Slobodová, A.: Deterministic versus nondeterministic space in terms of synchronized alternating machines. Theoret. Comput. Sci. 132, 319–336 (1994)
Jürgensen, H., Salomaa, K.: Block-synchronized context-free grammars. In: Du, D.Z., Ko, J.I. (eds.) Advances in Algorithms, Languages, and Complexity, pp. 111–137. Kluwer (1997)
McQuillan, I.: Descriptional complexity of block-synchronization context-free grammars. J. Autom. Lang. Comb. 9(2/3), 317–332 (2004)
McQuillan, I.: The generative capacity of block-synchronized context-free grammars. Theoret. Comput. Sci. 337(1-3), 119–133 (2005)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems, Pure and Applied Mathematics, vol. 90. Academic Press (1980)
Salomaa, A.: Formal Languages. ACM Monograph Series. Academic Press (1973)
Salomaa, K.: Synchronized tree automata. Theoret. Comput. Sci. 127, 25–51 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzer, M., Jakobi, S., McQuillan, I. (2012). Generalized Derivations with Synchronized Context-Free Grammars. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)