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...

Groups and semigroups generated by Mealy automata were formally introduced in the early sixties. They revealed their full potential over the years, by contributing to important conjectures in group theory. In the current chapter, we intend to provide various combinatorial and dynamical tools to tackle some decision problems all related to some extent to the growth of automaton (semi)groups. In ...

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

landsat data for 1992, 2000, and 2013 land use changes for ekbatan dam watershed was simulated through ca-markov” model. two classification methods were initially used, viz. the maximum likelihood (mal) and support vector machine (svm). although both methods showed high overall accuracy and kappa coefficient, visually mal failed in separating land uses, particularly built up and dry lands.there...

We introduce a new tool, called the orbit automaton, that describes the action of an automaton group G on the subtrees corresponding to the orbits of G on levels of the tree. The connection between G and the groups generated by the orbit automata is used to find elements of infinite order in certain automaton groups for which other methods failed to work.