We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of matrix rank into a regular language L, the minimal adjacency matrix rank of a deterministic automaton that recognises L. We then define and fo...

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

The set of synchronizing words a given n-state automaton forms regular language recognizable by an with \(2^n - n\) states. size recognizing for the is linked to computational problems related synchronization and length words. Hence, it natural investigate automata extremal this property, i.e., such that minimal deterministic has sync-maximal permutation groups have been introduced in [S. Hoffm...

Quantum-dot Cellular Automata (QCA) is an emerging and promising technology that provides significant improvements over CMOS. Recently QCA has been advocated as an applicant for implementing reversible circuits. However QCA, like other Nanotechnologies, suffers from a high fault rate. The main purpose of this paper is to develop a fault tolerant model of QCA circuits by redundancy in hardware a...

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

While deterministic nite automata seem to be well understood, surprisingly many important problems concerning nondeterministic nite automata (nfa's) remain open. One such problem area is the study of di erent measures of nondeterminism in nite automata and the estimation of the sizes of minimal nondeterministic nite automata. In this paper the concept of communication complexity is applied in o...

In this paper we improve the bounds on the complexity of solutions to the ̄ring squad problem, also known as the ̄ring synchronization problem. In the ̄ring synchronization problem we consider a one-dimensional array of n identical ̄nite automata. Initially all automata are in the same state except for one automaton designated as the initiator for the synchronization. Our results hold for the origi...