Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton

Biljana Stamatovic and Goran Kilibarda

Mathematical Problems in Engineering, 2017, vol. 2017, 1-7

Abstract:

We propose a finite automaton based algorithm for identification of infinite clusters in a 2D rectangular lattice with cells. The algorithm counts infinite clusters and finds one path per infinite cluster in a single pass of the finite automaton. The finite automaton is minimal according to the number of states among all the automata that perform such task. The correctness and efficiency of the algorithm are demonstrated on a planar percolation problem. The algorithm has a computational complexity of and could be appropriate for efficient data flow implementation.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/8251305.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/8251305.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8251305

DOI: 10.1155/2017/8251305

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().