scientific article; zbMATH DE number 3341950
From MaRDI portal
Publication:5618323
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics in general (00-01) Mathematics in general (00A05) 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)
Cited in
(33)- Computations of (alpha,k)-machines
- A C-version of minimal Boolean sum-of-product forms
- Recursive nonlinear estimation: Geometry of a space of posterior densities
- Optimizing two types of discrete functions, subject to linear restrictions
- Generalized approach to statistical recognition of automata
- \(L\)-fuzzy sets and codes
- Generalized algebraic structures for the representation of discrete systems
- Threshold agent networks: An approach to modelling and simulation
- Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers.
- On linear combinations of binary item scores
- Algebraic representations for finite-state machines. I. Monoid-ring formulation
- Linear recurring sequences over rings and modules
- Remark on coding in algebras with strong filtration
- Graphs and nonnegative matrices
- Shortcuts, diversions, and maximal chains in partially ordered sets
- A topological notion of boundedness
- Algebraic representations for finite-state machines. II: Module formulation
- On tools for completeness of Kleene algebra with hypotheses
- Fibonacci numbers and self-dual lattice structures for plane branches
- Congruences of finite automata
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- Computer description of finite fields
- On relations and matrices
- Synthesis of linear sequential machines†
- scientific article; zbMATH DE number 1522507 (Why is no real title available?)
- Partitioning the full range of Boolean functions based on the threshold and threshold relation
- ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS
- VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION
- Kleene algebra with observations
- Bounds for permutation arrays under Kendall tau metric
- On propositional program equivalence (extended abstract)
- Minimal Boolean sum-of-product forms in PROLOG
- Adaptation and complexity in repeated games
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 Q5618323)
