Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton
Joint Authors
Kilibarda, Goran
Stamatovic, Biljana
Source
Mathematical Problems in Engineering
Issue
Vol. 2017, Issue 2017 (31 Dec. 2017), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2017-10-24
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
We propose a finite automaton based algorithm for identification of infinite clusters in a 2D rectangular lattice with L=X×Y 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 O(L) and could be appropriate for efficient data flow implementation.
American Psychological Association (APA)
Stamatovic, Biljana& Kilibarda, Goran. 2017. Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton. Mathematical Problems in Engineering،Vol. 2017, no. 2017, pp.1-7.
https://search.emarefa.net/detail/BIM-1192262
Modern Language Association (MLA)
Stamatovic, Biljana& Kilibarda, Goran. Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton. Mathematical Problems in Engineering No. 2017 (2017), pp.1-7.
https://search.emarefa.net/detail/BIM-1192262
American Medical Association (AMA)
Stamatovic, Biljana& Kilibarda, Goran. Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton. Mathematical Problems in Engineering. 2017. Vol. 2017, no. 2017, pp.1-7.
https://search.emarefa.net/detail/BIM-1192262
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1192262