Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 8251305, 7 pages
https://doi.org/10.1155/2017/8251305
Research Article

Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton

1Faculty of Information Systems and Technologies, University of Donja Gorica, Podgorica, Montenegro
2Faculty of Project and Innovation Management, Educons University, Belgrade, Serbia

Correspondence should be addressed to Biljana Stamatovic; em.ude.gdu@civotamats.anajlib

Received 5 April 2017; Revised 25 August 2017; Accepted 27 September 2017; Published 24 October 2017

Academic Editor: Yakov Strelniker

Copyright © 2017 Biljana Stamatovic and Goran Kilibarda. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. E. Shannon, “Presentation of a maze-solving machine, Cybernetics Trans,” in proceedings of the 8th Conf. of the Josiah Macu Jr. Found, pp. 173–180, 1951.
  2. V. B. Kudryavtsev, S. M. Uscumlic, and G. Kilibarda, “The behavior of automata in labyrinths,” Discrete mathematics and applications, vol. 4, pp. 3–28, 1992. View at Google Scholar
  3. G. Kilibarda, V. B. Kudryavtsev, and S. M. Uscumlic, “Collectives of automata in labyrinths,” Discrete Mathematics and Applications, vol. 15, pp. 3–39, 2003. View at Google Scholar
  4. G. Kilibarda, “Universal labyrinth traps for finite sets of automata,” Discrete Mathematics and Applications, vol. 2, pp. 72–79, 1990. View at Google Scholar
  5. G. Kilibarda, “On the complexity of traversing labyrinths by an automaton,” Discrete mathematics and applications, vol. 5, pp. 116–124, 1993. View at Google Scholar
  6. M. Blum and D. Kozen, “On the power of the compass,” in Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 132–142, 1978.
  7. B. Stamatovic, “On recognizing labyrinth with automata,” Discrete Mathematics and Applications, vol. 12, pp. 51–65, 2000. View at Google Scholar
  8. B. Stamatovic, “Automata recognition two-connected labyrinth with finite cycle diameter,” Programming and Computer Software, vol. 36, pp. 149–157, 2010. View at Google Scholar
  9. S. Kirkpatrick, “Percolation and conduction,” Reviews of Modern Physics, vol. 45, no. 4, pp. 574–588, 1973. View at Publisher · View at Google Scholar · View at Scopus
  10. B. I. Shklovskii and A. L. Efros, Electronic Properties of Doped Semiconductors, Springer-Verlag, 1984.
  11. D. Stauffer, Introduction to Percolation Theory, Taylor & Francis, Abingdon, UK, 1992. View at Publisher · View at Google Scholar
  12. A. Bunde and S. Havlin, Eds., Fractals and Disordered Systems, Springer-Verlag, Berlin, Germany, 1996.
  13. J. Hoshen, P. Klymko, and R. Kopelman, “Percolation and cluster distribution. III. Algorithms for the site-bond problem,” Journal of Statistical Physics, vol. 21, no. 5, pp. 583–600, 1979. View at Publisher · View at Google Scholar · View at Scopus
  14. E. Stoll, “A fast cluster counting algorithm for percolation on and off lattices,” Computer Physics Communications, vol. 109, no. 1, pp. 1–5, 1998. View at Publisher · View at Google Scholar · View at Scopus
  15. R. C. Brower, P. Tamayo, and B. York, “A parallel multigrid algorithm for percolation clusters,” Journal of Statistical Physics, vol. 63, no. 1-2, pp. 73–88, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. M. E. J. Newman and R. M. Ziff, “Efficient Monte Carlo algorithm and high-precision results for percolation,” Physical Review Letters, vol. 85, no. 19, pp. 4104–4107, 2000. View at Publisher · View at Google Scholar · View at Scopus
  17. R. Trobec and B. Stamatovic, “Analysis and classification of flow-carrying backbones in two-dimensional lattices,” Advances in Engineering Software, vol. 103, pp. 38–45, 2017. View at Publisher · View at Google Scholar · View at Scopus
  18. B. Stamatovic and R. Trobec, “Cellular automata labeling of connected components in n-dimensional binary lattices,” The Journal of Supercomputing, vol. 72, no. 11, pp. 4221–4232, 2016. View at Publisher · View at Google Scholar · View at Scopus
  19. R. M. Ziff, P. T. Cummings, and G. Stells, “Generation of percolation cluster perimeters by a random walk,” Journal of Physics A: General Physics, vol. 17, no. 15, article no. 018, pp. 3009–3017, 1984. View at Publisher · View at Google Scholar · View at Scopus
  20. R. M. Ziff, “Hull-generating walks,” Physica D: Nonlinear Phenomena, vol. 38, no. 1-3, pp. 377–383, 1989. View at Publisher · View at Google Scholar · View at Scopus
  21. R. M. Ziff, “Spanning probability in 2D percolation,” Physical Review Letters, vol. 69, no. 18, pp. 2670–2673, 1992. View at Publisher · View at Google Scholar · View at Scopus
  22. H. Fleischner, “Eulerian graphs and related topics,” Annals of Discrete Mathematics, No. 50, Part 1, vol. 2, 1991. View at Google Scholar
  23. T. Y. Kong and A. Rosenfeld, “Digital topology: Introduction and survey,” Computer Vision Graphics and Image Processing, vol. 48, no. 3, pp. 357–393, 1989. View at Publisher · View at Google Scholar · View at Scopus
  24. M. J. Lee, “Pseudo-random-number generators and the square site percolation threshold,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 78, no. 3, Article ID 031131, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. W.-G. Yin and R. Tao, “Algorithm for finding two-dimensional site percolation backbones,” Physica B: Condensed Matter, vol. 279, no. 1-3, pp. 84–86, 2000. View at Publisher · View at Google Scholar · View at Scopus