The concept of π-directable automata is a concomitant specialization concept of the directable automata and generalization of the concept definite automata. The main purpose of this survey is to describe certain properties of πdirectable and definite automata. These are mainly algebraic and structural properties, as well as the properties of their transition semigroups. Various specializations ...

In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.

Abstract Predicate intuitionistic logic is a well-established fragment of dependent types. Proof construction in this logic, as the Curry–Howard isomorphism states, process program synthesis. We present automata that can handle proof and synthesis full first-order logic. Given formula, we construct an automaton such formula provable if only has accepting run. As further research, makes it possi...

The Krohn-Rhodes complexity theory for pure (without lin-earity) automata is well-known. This theory uses an operation of wreath product as a decomposition tool. The main goal of the paper is to introduce the notion of complexity of linear automata. This notion is ultimately related with decompositions of linear automata. The study of these decom-positions is the second objective of the paper. ...