On completeness of the binary boundedly determined functions with respect to superposition
From MaRDI portal
automataBoolean functionssuperpositionsystems of one-place boundedly determined functionssystems of two-place functions
Recommendations
Cited in
(11)- Every superinterval of the function range can be an interval-computations enclosure
- One-counter pushdown-storage automata as transducers of sequences
- Periodic properties of autonomous automata with pushdown storage
- Superpositions of bounded-deterministic functions
- Periodic properties of pushdown automata
- Completeness of systems of functions for classes of extended superposition
- Number of labelings of definite automata graphs
- scientific article; zbMATH DE number 3855105 (Why is no real title available?)
- scientific article; zbMATH DE number 4101101 (Why is no real title available?)
- Functional systems with the superposition operation
- Automata algebras
This page was built for publication: On completeness of the binary boundedly determined functions with respect to superposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3352966)