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