Skip to main content
SpringerLink
Log in
Book cover

Emergent Computation pp 171–213Cite as

Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts

  • Chapter
  • First Online:

  • 1361 Accesses

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 24))

Abstract

We investigate the emergent factors that affect the expressiveness of parallel communicating grammar systems (PCGS) with context-free components. It is already known that synchronization is a significant such a factor. In addition we show that serving multiple queries from multiple components simultaneously (broadcast communication) is not an emergent factor, but serving multiple queries from a single component is. We further identify a notion of interference that has significant emergent consequences. In the process we introduce several potentially useful techniques for the analysis of PCGS with context-free components. In particular we introduce the notion of PCGS parse trees, and also some techniques such as “copycat” components and “reset” components that are potentially useful in developing an algorithm for the elimination of broadcast communication.

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 04), Lecture Notes in Computer Science, vol. 2988, pp. 467–481. Springer (2004)

    Google Scholar 

  2. Bergstra, J.A., Klop, J.W.: Process theory based on bisimulation semantics. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, vol. 354, pp. 50–122. Springer (1988)

    Google Scholar 

  3. Bruda, S.D., Bin Waez, M.T.: Unrestricted and disjoint operations over multi-stack visibly pushdown languages. In: Proceedings of the 6th International Conference on Software and Data Technologies (ICSOFT 2011), vol. 2, pp. 156–161. Seville, Spain (2011)

    Google Scholar 

  4. Bruda, S.D., Wilkin, M.S.R.: Parse trees and unique queries in context-free parallel communicating grammar systems. Technical Report 2013-001, Department of Computer Science, Bishop’s University (2013)

    Google Scholar 

  5. Cai, L.: The computational complexity of linear PCGS. Comput. AI 15(2–3), 199–210 (1989)

    MathSciNet  Google Scholar 

  6. Csuhaj-Varjú, E.: On size complexity of context-free returning parallel communicating grammar systems. In: Martin-Vide, C., Mitrana, V. (eds.) Where Mathematics, Computer Scients, Linguistics and Biology Meet, pp. 37–49. Springer (2001)

    Google Scholar 

  7. Csuhaj-Varjú, E., Vaszil, G.: On the computational completeness of context-free parallel communicating grammar systems. Theor. Comput. Sci. 215(1–2), 349–358 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Csuhaj-Varjú, E., Vaszil, G.: On the size complexity of non-returning context-free PC grammar systems. In: 11th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2009), pp. 91–100 (2009)

    Google Scholar 

  9. Csuhaj-Varjú, E., Vaszil, G.: On the number of components and clusters of nonreturning parallel communicating grammar systems. In: Holzer, M., Kutrib, M., Pighizzing, G. (eds.) 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2011), pp. 121–134. Gieen/Limburg, Germany (2011)

    Google Scholar 

  10. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Paun, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)

    MATH  Google Scholar 

  11. Csuhaj-Varjú, E., Gheorghe, P., Vaszil, G.: PC grammar systems with five context-free components generate all recursively enumerable languages. Theor. Comput. Sci. 299, 785–794 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dassow, J., Paun, G., Rozenberg, G.: Grammar systems. In: Handbook of Formal Languages—Volume 2: Linear Modeling: Background and Applications, pp. 155–213. Springer (1997)

    Google Scholar 

  13. De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dumitrescu, S.: Non-returning PC grammar systems can be simulated by returning systems. Theor. Comput. Sci. 165, 463–474 (1996)

    Article  MATH  Google Scholar 

  15. Fernau, H.: Parallel communicating grammar systems with terminal transmission. Acta Inform. 37, 511–540 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fischer, P.C.: Turing machines with restricted memory access. Inform. Comput. 9, 364–379 (1966)

    MathSciNet  MATH  Google Scholar 

  17. Garey, M.R., Johnson, D.S.: Computers and Intractability a Guide to the Theory of NP-Completeness. Macmillan Higher Education (1979)

    Google Scholar 

  18. Geffert, V.: Context-free-like forms for the phrase-structure grammars. In: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 324, pp. 309–317. Springer (1988)

    Google Scholar 

  19. Grando, M.A., Mitrana, V.: A possible connection between two theories: grammar systems and concurrent programming. Fundam. Inform. 76, 325–336 (2007)

    MathSciNet  MATH  Google Scholar 

  20. Katsirelos, G., Maneth, S., Narodytska, N., Walsh, T.: Restricted global grammar contraints. In: Principles and Practice of Constraint Programming (CP 2009), Lecture Notes in Computer Science, vol. 5732, pp. 501–508 (2009)

    Google Scholar 

  21. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 07), pp. 161–170. IEEE Computer Society, Washington, DC (2007)

    Google Scholar 

  22. Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice-Hall (1998)

    Google Scholar 

  23. Mandache, N.: On the computational power of context-free PCGS. Theor. Comput. Sci. 237, 135–148 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  24. Paun, G., Santean, L.: Parallel communicating grammar systems: the regular case. Analele Universitatii din Bucuresti, Seria Matematica-Informatica 38(2), 55–63 (1989)

    MathSciNet  MATH  Google Scholar 

  25. Paun, G., Santean, L.: Further remarks on parallel communicating grammar systems. Int. J. Comput. Math. 34, 187–203 (1990)

    Article  MATH  Google Scholar 

  26. Santean, L.: Parallel communicating grammar systems. Bull. EATCS (Formal Lang. Theory Column) 1(2) (1990)

    Google Scholar 

  27. Wilkin, M.S.R., Bruda, S.D.: Parallel communicating grammar systems with context-free components are Turing complete for any communication model. Technical Report 2014-003, Department of Computer Science, Bishop’s University (2014)

    Google Scholar 

Download references

Acknowledgments

This research was supported by Bishop’s University. Part of this research was also supported by the Natural Sciences and Engineering Research Council of Canada. We are indebted to an anonymous reviewer of one of our papers, who offered an extension of one of our results free of charge! Indeed, the second part of Corollary 4 as well as the respective portion of the subsequent proof are essentially the work of that reviewer.

Author information

Authors and Affiliations

  1. Department of Computer Science, Bishop’s University, Sherbrooke, QC, J1M 1Z7, Canada

    Stefan D. Bruda & Mary Sarah Ruth Wilkin

Authors
  1. Stefan D. Bruda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mary Sarah Ruth Wilkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan D. Bruda .

Editor information

Editors and Affiliations

  1. Unconventional Computing Centre, University of the West of England Unconventional Computing Centre, Bristol, United Kingdom

    Andrew Adamatzky

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Bruda, S.D., Wilkin, M.S.R. (2017). Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts. In: Adamatzky, A. (eds) Emergent Computation . Emergence, Complexity and Computation, vol 24. Springer, Cham. https://doi.org/10.1007/978-3-319-46376-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46376-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46375-9

  • Online ISBN: 978-3-319-46376-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation