Algorithm for identification of infinite clusters based on minimal finite automaton

DOI10.1155/2017/8251305zbMath1426.68156OpenAlexW2765926613MaRDI QIDQ1993194

Biljana Stamatovic, Goran Kilibarda

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/8251305

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulerian graphs and related topics. Part 1, Volume 2
• A fast cluster counting algorithm for percolation on and off lattices
• Automaton recognition of doubly connected labyrinths with finite cyclic diameter
• On behaviour of automata in labyrinths
• On recognizing labyrinths by automata
• Collectives of automata in labyrinths

This page was built for publication: Algorithm for identification of infinite clusters based on minimal finite automaton