Analyzing the structure of a class of linear automata over a ring Z_p^k
From MaRDI portal
Publication:946779
DOI10.1007/S10559-008-9003-2zbMATH Open1158.68024OpenAlexW2131044892MaRDI QIDQ946779FDOQ946779
Authors: V. V. Skobelev
Publication date: 24 September 2008
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-008-9003-2
Recommendations
- Analysis of linear automata over the ring \(\mathbb Z_{p^k}\)
- Studying the structure of a set of linear information-lossless automata over the ring \({\mathcal Z}_{p^k}\)
- On the complexity of analysis of automata over a finite ring
- Analysis of Resler's automaton over finite ring
- Analysis of automata determined by parametric varieties over an associative ring.
- Analysis of Sprott's automaton over some finite ring
- Analysis of the problem of recognition of an automaton over some ring
- scientific article; zbMATH DE number 7237059
- scientific article; zbMATH DE number 4068285
- Decomposition of linear automata over residue rings into shift-registers
fixed pointfinite ringcanonical formparametric identificationstate equivalenceinitial state identificationlinear automaton
Cites Work
- Title not available (Why is that?)
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear automata over a finite ring
- On the invertible matrices over the ring \(\mathbb Z_{p^k}\).
- On Information Lossless Automata of Finite Order
- Title not available (Why is that?)
Cited In (17)
- Analysis of linear automata over the ring \(\mathbb Z_{p^k}\)
- Analysis of Sprott's automaton over some finite ring
- Maximum subclasses in classes of linear automata over finite fields
- Title not available (Why is that?)
- Nonlinear automata over a finite ring
- Characteristics of linear one-dimensional automata with delay \(l\) over a finite ring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two types of nonlinear automata over a finite ring
- Analysis of families of hash functions defined by automata over a finite ring
- On two sequences of sets of mappings of abstract sets into a Dedekind ring
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- On the complexity of analysis of automata over a finite ring
- Decomposition of linear automata over residue rings into shift-registers
This page was built for publication: Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946779)