Nonlinear automata over a finite ring

DOI10.1007/S10559-006-0120-5zbMATH Open1127.68055OpenAlexW2012737466MaRDI QIDQ2458091FDOQ2458091

Authors: V. G. Skobelev 

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

Recommendations

• Two types of nonlinear automata over a finite ring
• Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
• scientific article; zbMATH DE number 7301716
• Analysis of linear automata over the ring \(\mathbb Z_{p^k}\)
• Analysis of Resler's automaton over finite ring

zbMATH Keywords

state identificationparametric identificationequivalent states

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• THE ABSTRACT THEORY OF AUTOMATA
• Title not available (Why is that?)
• Design of easily testable discrete devices: Ideas, methods, implementation
• Title not available (Why is that?)
• Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
• Title not available (Why is that?)
• Über Experimente an Automaten
• Interval formulation of the diagnostic problem for bilinear automaton
• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimation of the length of the shortest diagnostic word for a finite automaton

Cited In (17)

• Analysis of linear automata over the ring \(\mathbb Z_{p^k}\)
• Certain properties of noise-immune automata
• Characteristics of linear one-dimensional automata with delay \(l\) over a finite ring
• Generalized information-lossless automata. I
• Analysis of a class of easily computable permutations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata analogs of dynamic chaotic systems.
• Title not available (Why is that?)
• Two types of nonlinear automata over a finite ring
• Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
• Title not available (Why is that?)
• Symmetrical dynamical systems over a finite ring: their properties and complexity of identification
• Studying the structure of a set of linear information-lossless automata over the ring \({\mathcal Z}_{p^k}\)
• Analysis of Resler's automaton over finite ring
• Proving properties of a ring of finite-state machines
• On the complexity of analysis of automata over a finite ring

This page was built for publication: Nonlinear automata over a finite ring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458091)