Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton

<div>Traversing part of the FA <span class="nowrap"><svg height="14.3188pt" id="M114" style="vertical-align:-5.47413pt" version="1.1" viewbox="-0.0498162 -8.84467 19.5703 14.3188" width="19.5703pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M837 672C829 675 822 674 813 674C710 674 608 541 510 398C475 447 422 480 349 480C260 480 162 415 162 299C162 199 212 133 284 92C229 39 191 15 134 15C91 15 69 45 69 65H71C78 54 95 53 100 53C128 53 143 80 143 101C143 128 121 149 93 149C60 149 31 121 31 77C31 24 74 -15 138 -15C198 -15 255 22 311 79C360 56 416 43 473 39L455 0H552L569 42C612 49 661 63 693 87L684 103C657 88 617 76 581 69C677 301 753 477 846 658L837 672ZM772 638C701 530 628 379 559 227C558 279 547 330 526 371C609 494 688 609 771 638H772ZM536 199C536 191 536 184 535 176L486 67C430 71 380 84 335 105C395 173 451 257 507 344C527 301 536 251 536 199ZM492 372C431 277 369 183 310 119C245 158 203 217 203 301S275 447 349 447C416 447 461 417 492 372Z" id="g198-2"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.115,3.132)"><path d="M481 430L460 436C440 442 393 451 366 451C348 451 325 448 313 446C267 437 195 409 147 367C79 308 24 211 24 105C24 37 56 -12 93 -12C121 -12 156 1 199 32C246 66 313 122 349 168H351L286 -147C274 -205 261 -215 210 -224L199 -226L193 -255L438 -243L442 -214L417 -212C364 -208 359 -200 370 -140L433 204C455 324 469 389 481 430ZM391 385C382 336 366 260 358 238C321 178 209 59 143 59C129 59 115 83 115 131C115 207 152 317 220 373C243 392 282 403 314 403C348 403 374 395 391 385Z" id="g50-114"></path></g><g transform="matrix(.0065,0,0,-0.0065,15.61,5.233)"><path d="M405 367C405 413 360 454 298 454C251 454 197 434 150 401C64 340 25 235 25 140C25 14 99 -12 150 -12C198 -12 287 5 379 106L360 137C311 89 250 57 202 57C136 57 114 110 114 165V187C210 209 405 256 405 367ZM322 353C322 310 277 263 122 227C137 341 191 386 225 400C233 403 254 409 264 409C299 409 322 394 322 353Z" id="g176-102"></path></g></svg>,</span> where <svg height="11.5564pt" id="M115" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 71.1194 11.5564" width="71.1194pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M536 404C536 423 520 448 491 448C445 448 398 404 308 283L286 338C255 416 242 448 217 448C182 448 138 402 92 341L111 321C149 368 169 378 178 378C188 378 198 363 214 320L254 212C185 117 138 65 107 65C98 65 85 69 82 75C79 82 73 86 65 86C44 86 23 60 23 39C23 7 44 -12 71 -12C119 -12 168 33 265 177L306 61C321 17 347 -12 373 -12C413 -12 465 33 507 96L491 119C459 84 432 60 413 60C395 60 378 92 358 148L321 250C341 279 369 310 389 332C417 363 439 382 456 382C466 382 475 376 481 368C486 361 492 358 496 358C513 358 536 381 536 404Z" id="g113-121"></path></g><g transform="matrix(.013,0,0,-0.013,10.899,0)"><path d="M448 1V51H364C248 51 153 129 140 230H448V280H140C153 381 248 459 364 459H448V509H365C208 509 80 395 80 255S208 1 365 1H448Z" id="g117-173"></path></g><g transform="matrix(.013,0,0,-0.013,21.395,0)"><path d="M293 -169V-141C218 -131 209 -90 209 -44C209 19 222 85 222 152C222 207 198 255 139 269V273C199 286 222 334 222 388C222 454 209 523 209 588C209 632 218 671 293 681V709C234 709 148 695 148 577C147 513 155 438 155 372C155 337 152 291 64 285V256C152 250 155 204 155 169C156 105 148 31 148 -41C148 -157 234 -169 293 -169Z" id="g113-124"></path></g><g transform="matrix(.013,0,0,-0.013,25.906,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path></g><g transform="matrix(.013,0,0,-0.013,32.146,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path></g><g transform="matrix(.013,0,0,-0.013,37.289,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z" id="g113-50"></path></g><g transform="matrix(.013,0,0,-0.013,43.587,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path></g><g transform="matrix(.013,0,0,-0.013,48.73,0)"><path d="M412 140C382 77 369 73 315 73H129L270 222C362 320 402 379 402 466C402 571 322 635 234 635C177 635 130 609 99 576L42 495L64 475C90 514 133 568 201 568C274 568 318 519 318 435C318 349 255 267 193 193C144 135 87 78 32 23V0H405C417 45 427 89 440 131L412 140Z" id="g113-51"></path></g><g transform="matrix(.013,0,0,-0.013,54.97,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path></g><g transform="matrix(.013,0,0,-0.013,60.113,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z" id="g113-52"></path></g><g transform="matrix(.013,0,0,-0.013,66.411,0)"><path d="M283 255V284C195 290 192 337 192 375C192 436 200 508 200 580C200 696 116 709 54 709V681C127 671 139 634 139 588C138 524 125 452 125 387C125 333 149 286 209 272V268C148 253 125 206 125 151C126 87 139 16 139 -47C139 -92 127 -131 54 -141V-169C115 -169 200 -152 200 -41C200 32 192 104 192 164C192 202 195 249 283 255Z" id="g113-126"></path></g></svg> before starting labeling.</div>

Mathematical Problems in Engineering

fig3

Figure 3

Figure 3: Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton 