Skip to main content
SpringerLink
Log in

Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views

  • Conference paper
Book cover Descriptional Complexity of Formal Systems (DCFS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8031))

Included in the following conference series:

  • 446 Accesses

Abstract

The paper brings new insights into the complexity of Szilard languages (SZLs) of Parallel Communicating Grammar Systems (PCGSs). We investigate the structure of Szilard words for several classes of PCGSs with context-free rules. We prove that the classes of SZLs of returning centralized and non-returning non-centralized PCGSs are included in circuit complexity class \({\mathcal N}{\mathcal C}^1\). As a consequence, this result also holds for the class of SZLs of non-returning centralized PCGSs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity, vol. II. Springer, Heidelberg (1990)

    Book  MATH  Google Scholar 

  2. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. of ACM 28(1), 114–133 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, Yverdon (1994)

    Google Scholar 

  4. Cojocaru, L., Mäkinen, E.: On the Complexity of Szilard Languages of Regulated Grammars. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 77–94. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Cojocaru, L., Mäkinen, E.: On the Complexity of Szilard Languages of Matrix Grammars. In: 13th IEEE International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 339–347. IEEE Press, Los Alamitos (2011)

    Chapter  Google Scholar 

  6. Hromkovič, J., Kari, J., Kari, L.: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. Theor. Comput. Sci. 127(1), 123–147 (1994)

    Article  MATH  Google Scholar 

  7. Mihalache, V.: Szilard Languages Associated to Parallel Communicating Grammar Systems. In: Dassow, J., Rozenberg, G., Salomaa, A. (eds.) DLT 1995, pp. 247–256. World Scientific, Singapore (1996)

    Google Scholar 

  8. Păun, G.: Parallel Communicating Grammar Systems: Recent Results, Open Problems. Acta Cybern. 12(4), 381–396 (1996)

    MATH  Google Scholar 

  9. Ruzzo, W.: On Uniform Circuit Complexity. J. Comput. Syst. Sci. 22(3), 365–383 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ţiplea, F.L., Ene, C., Ionescu, C.M., Procopiuc, O.: Some Decision Problems for Parallel Communicating Grammar Systems. Theor. Comput. Sci. 134, 365–385 (1994)

    Article  MATH  Google Scholar 

  11. Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, Heidelberg (1999)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Sciences, University of Tampere, Kanslerinrinne 1, Tampere, 33014, Finland

    Liliana Cojocaru & Erkki Mäkinen

Authors
  1. Liliana Cojocaru
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erkki Mäkinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, Western University, N6A 5B7, London, ON, Canada

    Helmut Jurgensen

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055,, 4169-007, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cojocaru, L., Mäkinen, E. (2013). Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views. In: Jurgensen, H., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2013. Lecture Notes in Computer Science, vol 8031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39310-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39310-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39309-9

  • Online ISBN: 978-3-642-39310-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation