zbMath0293.00002MaRDI QIDQ4044478
Harold S. Stone
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)
Exact enumeration problems, generating functions (05A15)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)
Semigroups in automata theory, linguistics, etc. (20M35)
Mathematics in general (00A05)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Other classical set theory (including functions, relations, and set algebra) (03E20)
Axiomatics and elementary properties of groups (20A05)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01)
Finite fields and commutative rings (number-theoretic aspects) (11Txx)
Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths,
Mathematical properties common in all mechanism models of chemical reactions,
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata,
Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\),
A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines,
Unnamed Item,
Modelling nonlinear sequence generators in terms of linear cellular automata,
Ambiguity and structural ambiguity of symmetric difference NFAs,
Transformation completeness properties of SVPC transformation sets,
MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS,
A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square,
Transformations of discrete closure systems,
On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages,
Procedures for calculating reversible one-dimensional cellular automata,
A similarity transform for linear finite state machines,
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square,
Discrete event simulation modelling of computer systems for performance evaluation,
An explicit similarity transform between cellular automata and LFSR matrices,
Unary Self-verifying Symmetric Difference Automata,
Ambiguity of Unary Symmetric Difference NFAs,
Semigroups containing ubiquitous elements,
On the qualitative/necessity possibility measure. I: Investigation in the framework of measurement theory,
Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
