Lower Bound of the Number of Threshold Functions

DOI10.1109/PGEC.1966.264574MaRDI QIDQ5537394zbMATH OpenOpenAlexFDO

Authors

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

Cited in

(14)

• Linear function neurons: Structure and training
• Optimal estimation on the order of local testability of finite automata
• Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
• 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
• Number of labelings of definite automata graphs
• Aspects of reversibility for classical automata
• scientific article; zbMATH DE number 3293675 (Why is no real title available?)
• Measuring power of generalised definite languages
• On the acceptance power of regular languages
• Further remarks on context-free grammars with subregular control languages
• Closure properties of subregular languages under operations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5537394)