We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is monad. The first part of the paper devoted to presenting construction monad suitable modelling (in)finite behaviour. second focuses on concepts (coalgebraic) automaton its ($\omega$-) end Kleene-type theorems regular input. framework instantiated ...

in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...

introduction flood is an inevitable natural phenomenon occurring from time to time in all rivers and natural drainage systems, which not only damages the lives, natural resources and environment, but also causes the loss of economy and health. so estimation and prediction flood hazard is very important spatially in the watersheds without measurement station. there are many models in the water a...

We study the problem DFA-SW of determining if a given deterministic finite automaton A possesses synchronizing word length at most k for automata whose (multi-)graphs are TTSPL, i.e. , series-parallel, plus allowing some self-loops. While remains NP-complete on TTSPL automata, we also find (further) restrictions with efficient (parameterized) algorithms. complexity related problems, instance, e...

Abstract Transforming $$\omega $$ ? -automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable all compare the methods experimentally show that our method produces significantly s...

Abstract In this work, we follow the construction of an n -ary system Cartesian composition multiautomata with internal links, where define links to homogeneous and heterogeneous products multi-automata. While introduction link is rectilinear in composition, it requires a new approach product for other two automata products. way, possible focus on multiple options creating these systems. More s...