Lower Bound of the Number of Threshold Functions

DOI10.1109/PGEC.1966.264574zbMath0156.01904OpenAlexW2086344316MaRDI QIDQ5537394

No author found.

Publication date: 1966

Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/pgec.1966.264574

zbMATH Keywords

mathematical logic

Related Items (12)

Aspects of Reversibility for Classical Automata ⋮ Number of labelings of definite automata graphs ⋮ Measuring power of generalised definite languages ⋮ Unnamed Item ⋮ Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order ⋮ On the acceptance power of regular languages ⋮ Determination of finite automata accepting subregular languages ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Locally testable languages ⋮ Characterizations of locally testable events ⋮ Optimal estimation on the order of local testability of finite automata ⋮ Linear function neurons: Structure and training

This page was built for publication: Lower Bound of the Number of Threshold Functions