Nonlinear automata over a finite ring
From MaRDI portal
Publication:2458091
DOI10.1007/s10559-006-0120-5zbMath1127.68055OpenAlexW2012737466MaRDI QIDQ2458091
Publication date: 31 October 2007
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-006-0120-5
Related Items
On the complexity of analysis of automata over a finite ring, Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\), Analysis of a class of easily computable permutations, Two types of nonlinear automata over a finite ring, Unnamed Item
Cites Work
- Design of easily testable discrete devices: Ideas, methods, implementation
- Interval formulation of the diagnostic problem for bilinear automaton
- THE ABSTRACT THEORY OF AUTOMATA
- Estimation of the length of the shortest diagnostic word for a finite automaton
- Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
- Über Experimente an Automaten
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item