scientific article; zbMATH DE number 3458508
Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Other classical set theory (including functions, relations, and set algebra) (03E20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Exact enumeration problems, generating functions (05A15) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01) Axiomatics and elementary properties of groups (20A05) Semigroups in automata theory, linguistics, etc. (20M35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
- Mathematical properties common in all mechanism models of chemical reactions
- A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines
- Transformation completeness properties of SVPC transformation sets
- Discrete event simulation modelling of computer systems for performance evaluation
- An explicit similarity transform between cellular automata and LFSR matrices
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- On the qualitative/necessity possibility measure. I: Investigation in the framework of measurement theory
- Procedures for calculating reversible one-dimensional cellular automata
- Semigroups containing ubiquitous elements
- Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
- Transformations of discrete closure systems
- Ambiguity and structural ambiguity of symmetric difference NFAs
- A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square
- A similarity transform for linear finite state machines
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
- Unary Self-verifying Symmetric Difference Automata
- Ambiguity of unary symmetric difference NFAs
- scientific article; zbMATH DE number 7444008 (Why is no real title available?)
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
- On obtaining long m-sequences from low-degree primitive polynomials
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
- Modelling nonlinear sequence generators in terms of linear cellular automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044478)
