[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

APCol Systems with Verifier Agents

  • Conference paper
  • First Online:
Membrane Computing (CMC 2018)

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

Included in the following conference series:

Abstract

APCol systems (Automaton-like P colonies) are variants of P colonies where the environment is given by a string and the agents change their own states and the environmental string similarly to automata. By the original definition, the input (initial environmental) string is accepted if it can be reduced to the empty word. In this paper, we continue the examination of a variant of APCol systems where the agents explore and verify their common environment (the notion was introduced as verifying APCol systems). In this case, an input string of length n is accepted if there is a halting computation c such that the length of the environmental strings remains unchanged during the computation and for every agent and for each position each i, \(1\le i\le n\), there is an environmental string obtained by c such that the agent applies a rule to position i. Improving a previous result, we show that APCol systems with verifier agents simulate nondeterministic two-way multihead automata. The result implies that any language in \(\text {NSPACE}(\log n)\)can be accepted by an APCol system with verifier agents.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

References

  1. Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E.: Towards on P colonies processing strings. In: Proceedings of BWMC 2014, Sevilla, pp. 102–118 (2014). Fénix Editora, Sevilla (2014)

    Google Scholar 

  2. Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E.: P colonies processing strings. Fundam. Inform. 134(1–2), 51–65 (2014)

    MathSciNet  MATH  Google Scholar 

  3. Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E.: A class of restricted P colonies with string environment. Nat. Comput. 15(4), 541–549 (2016)

    Article  MathSciNet  Google Scholar 

  4. Ciencialová, L., Csuhaj-Varjú, E., Cienciala, L., Sosík, P.: P colonies. Bull. Int. Membr. Comput. Soc. 1(2), 119–156 (2016)

    MATH  Google Scholar 

  5. Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E., Vaszil, Gy.: Verifying APCol systems. In: Hinze, T., Behre, J. (eds.) Proceedings of the 19th International Conference on Membrane Computing (CMC19), pp. 247–258. Verlag ProBusiness, Berlin (2018)

    Google Scholar 

  6. Csuhaj-Varjú, E., Kelemen, J., Păun, G., Dassow, J. (eds.): Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers Inc., Newark (1994)

    MATH  Google Scholar 

  7. Hartmanis, J.: On non-determinacy in simple computing devices. Acta Informatica 1, 336–344 (1972)

    Article  Google Scholar 

  8. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: origins and directions. Theor. Comput. Sci. 412, 83–96 (2011)

    Article  MathSciNet  Google Scholar 

  9. Kelemenová, A.: P colonies, chap. 23.1. In: Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, pp. 584–593. Oxford University Press, Oxford (2010)

    Google Scholar 

  10. Kelemen, J., Kelemenová, A., Păun, G.: Preview of P colonies: a biochemically inspired computing model. In: Workshop and Tutorial Proceedings. Ninth International Conference on the Simulation and Synthesis of Living Systems (ALIFE IX), Boston, MA, pp. 82–86 (2004)

    Google Scholar 

  11. Kelemen, J., Kelemenová, A.: A grammar-theoretic treatment of multiagent systems. Cybern. Syst. 23(6), 621–633 (1992)

    Article  MathSciNet  Google Scholar 

  12. Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)

    Article  MathSciNet  Google Scholar 

  13. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press Inc., New York (2010)

    MATH  Google Scholar 

  14. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages I-III. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6

    Book  Google Scholar 

Download references

Acknowledgments

The work of L. Ciencialová and L. Cienciala was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPU II) project IT4Innovations excellence in science - LQ1602, by SGS/13/2016. The work of E. Csuhaj-Varjú and Gy. Vaszil was supported by Grant No. 120558 of the National Research, Development, and Innovation Office, Hungary.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Erzsébet Csuhaj-Varjú .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ciencialová, L., Csuhaj-Varjú, E., Vaszil, G., Cienciala, L. (2019). APCol Systems with Verifier Agents. In: Hinze, T., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2018. Lecture Notes in Computer Science(), vol 11399. Springer, Cham. https://doi.org/10.1007/978-3-030-12797-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12797-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12796-1

  • Online ISBN: 978-3-030-12797-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics