Abstract
We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of regulated rewriting grammars. The main goal is to relate these languages to low-level complexity classes such as \(\cal N\) \(\cal C\) 1 and \(\cal N\) \(\cal C\) 2. We focus on the derivation process in random context grammars (RCGs) with context-free rules. We prove that unrestricted SZLs and leftmost-1 SZLs of RCGs can be accepted by ATMs in logarithmic time and space. Hence, these languages belong to the \(U_{E^*}\)-uniform \(\cal N\) \(\cal C\) 1 class. Leftmost-i SZLs, i ∈ {2,3}, of RCGs can be accepted by ATMs in logarithmic space and square logarithmic time. Consequently, these languages belong to \(\cal N\) \(\cal C\) 2. Moreover, we give results on SZLs of RCGs with phrase-structure rules and present several applications on SZLs of other regulated rewriting grammars.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity, vol. II. Springer, Heidelberg (1990)
Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM 28(1), 114–133 (1981)
Cojocaru, L., Mäkinen, E., Ţiplea, F.L.: Classes of Szilard Languages in NC1. In: 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 299–306. IEEE Computer Society Press, Los Alamitos (2009)
Cremers, A.B., Maurer, H.A., Mayer, O.: A Note On Leftmost Restricted Random Context Grammars. Inf. Process. Lett. 2(2), 31–33 (1973)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)
Duske, J., Parchmann, R., Specht, J.: Szilard Languages of IO-Grammars. Information and Control 40(3), 319–331 (1979)
Ewert, S., van der Walt, A.P.J.: A Pumping Lemma for Random Permitting Context Languages. Theor. Comput. Sci. 270(1-2), 959–967 (2002)
Fischer, P., Meyer, A., Rosenberg, A.: Counter Machines and Counter Languages. Theory of Computing Systems 2(3), 265–283 (1968)
Hesse, W.: Division Is in Uniform TC0. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 104–114. Springer, Heidelberg (2001)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Massachusetts (1979)
Igarashi, Y.: The Tape Complexity of Some Classes of Szilard Languages. SIAM J. Comput. 6(3), 460–466 (1977)
Mäkinen, E.: On Certain Properties of Left Szilard Languages. EIK 19(10/11), 497–501 (1983)
Mäkinen, E.: On Context-Free and Szilard Languages. BIT Numerical Mathematics 24(2), 164–170 (1984)
Păun, G.: On Szilard’s Languages Associated to a Matrix Grammar. Inf. Process. Lett. 8(2), 104–105 (1979)
Penttonen, M.: On Derivation Language Corresponding to Context-Free Grammars. Acta Inf. 3, 285–291 (1974)
Penttonen, M.: Szilard Languages Are log n Tape Recognizable. EIK 13(11), 595–602 (1977)
Rosenkrantz, D.J.: Programmed Grammars - a New Device for Generating Formal Languages. PhD Thesis, Columbia University, New York (1967)
Rosenkrantz, D.J.: Programmed Grammars and Classes of Formal Languages. J. ACM 16(1), 107–131 (1969)
Ruzzo, W.: On Uniform Circuit Complexity. J. Comput. Syst. Sci. 22(3), 365–383 (1981)
Salomaa, A.: Matrix Grammars with a Leftmost Restriction. Information and Control 20(2), 143–149 (1972)
Salomaa, A.: Formal Languages. Academic Press, London (1973)
Vollmer, H.: Introduction to Circuit Complexity A Uniform Approach. Springer, Heidelberg (1999)
van der Walt, A.P.J.: Random Context Languages. In: Information Processing. Proceedings of IFIP Congress, vol. 1, pp. 66–68. North-Holland, Amsterdam (1972)
van der Walt, A.P.J., Ewert, S.: A Shrinking Lemma for Random Forbidding Context Languages. Theor. Comput. Sci. 237(1-2), 149–158 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cojocaru, L., Mäkinen, E. (2011). On the Complexity of Szilard Languages of Regulated Grammars. In: Cerone, A., Pihlajasaari, P. (eds) Theoretical Aspects of Computing – ICTAC 2011. ICTAC 2011. Lecture Notes in Computer Science, vol 6916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23283-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-23283-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23282-4
Online ISBN: 978-3-642-23283-1
eBook Packages: Computer ScienceComputer Science (R0)